File:Encoder Disc (3-Bit).svg
From Infogalactic: the planetary knowledge core
Size of this PNG preview of this SVG file: 284 × 284 pixels. Other resolution: 240 × 240 pixels.
Original file (SVG file, nominally 284 × 284 pixels, file size: 6 KB)
Summary
A Rotary Encoder Disc with a 3-Bit Binary Reflected <a href="https://en.wikipedia.org/wiki/Gray_code" class="extiw" title="w:Gray code">Gray Code</a> (BRGC).
Licensing
Lua error in package.lua at line 80: module 'strict' not found.
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 17:39, 7 January 2017 | 284 × 284 (6 KB) | 127.0.0.1 (talk) | <p>A Rotary Encoder Disc with a 3-Bit Binary Reflected <a href="https://en.wikipedia.org/wiki/Gray_code" class="extiw" title="w:Gray code">Gray Code</a> (BRGC). </p> |
- You cannot overwrite this file.
File usage
The following 48 pages link to this file:
- 3-opt
- AF-heap
- Adjacency algebra
- Algebraic enumeration
- Broken space diagonal
- Cake number
- Cameron–Erdős conjecture
- Cayley's mousetrap
- Colored matroid
- Combinatorial hierarchy
- Cycle decomposition (graph theory)
- DIMACS
- Dinitz conjecture
- Dipole graph
- Disjunction property of Wallman
- Disperser
- Double-star snark
- Euclidean shortest path
- Gowers norm
- Graph enumeration
- Gray code
- Greedy randomized adaptive search procedure
- Higher spin alternating sign matrix
- Higman's lemma
- Independence system
- Kalmanson combinatorial conditions
- Lieb's square ice constant
- Magic graph
- Map folding
- Milliken–Taylor theorem
- Modular product of graphs
- Network dynamics
- Pandiagonal magic cube
- Path coloring
- Random minimal spanning tree
- Regular Hadamard matrix
- Rotary encoder
- Shortest-path tree
- Sperner property of a partially ordered set
- Szekeres snark
- Szymanski's conjecture
- T-theory
- Transversal (combinatorics)
- Tree spanner
- Tutte matrix
- Visibility graph analysis
- Watkins snark
- Template:Combin-stub