File:Encoder Disc (3-Bit).svg
From Wikipedia, the free encyclopedia
Encoder_Disc_(3-Bit).svg (SVG file, nominally 284 × 284 pixels, file size: 6 KB)
| This is a file from the Wikimedia Commons. The description on its description page there is shown below.
|
.svg){kind=small}
[edit] Summary
| Description |
A Rotary Encoder Disc with a 3-Bit Binary Reflected Gray Code (BRGC). |
|---|---|
| Date |
22/05/06 |
| Source |
Replacement for Image:Encoder_disc.png |
| Author |
jjbeard |
| Permission (Reusing this image) |
PD |
| Other versions | Image:Encoder_disc.png |
[edit] Licensing
File history
Click on a date/time to view the file as it appeared at that time.
(latest | earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 02:57, 22 May 2006 | | 284×284 (6 KB) | Jjbeard | ({{Information| |Description=An Encoder Disc with a 3-Bit Reflected Gray Code |Source=Replacement for Image:Encoder_disc.png |Date=22/05/06 |Author=jjbeard |Permission=PD |other_versions=Image:Encoder_disc.png }} [[Category:Electrical_Engineerin) |
File links
More than 100 pages link to this file. The following list shows the first 100 page links to this file only. A full list is available.
- Containment hierarchy
- Disperser
- Steiner system
- Gray code
- Algebraic enumeration
- Bimagic cube
- Trimagic cube
- Semiperfect magic cube
- Bimagic square
- Bruck–Chowla–Ryser theorem
- Vertex-transitive graph
- Edge-transitive graph
- Weak order of permutations
- Exact coloring
- Erdős–Faber–Lovász conjecture
- Most-perfect magic square
- Family of sets
- N-set
- Rotary encoder
- Combinatorial explosion (communication)
- Transversal
- Dinitz conjecture
- Wedderburn-Etherington number
- Analytic combinatorics
- Hall–Janko graph
- Steiner points
- K-minimum spanning tree
- Menger's theorem
- Random minimal spanning tree
- Bridge (graph theory)
- Broken space diagonal
- Rooted graph
- Pandiagonal magic cube
- Transportation network (graph theory)
- Visibility graph analysis
- Circuit rank
- Vertex separator
- Null graph
- Combinatorial principles
- Rule of product
- Tutte theorem
- Cycle decomposition
- Metric dimension (graph theory)
- Network (mathematics)
- AF-heap
- Monochromatic triangle
- Cut vertex
- Szemerédi regularity lemma
- Pascal's simplex
- Giant component
- Tetramagic square
- Semi-symmetric graph
- Steinhaus–Johnson–Trotter algorithm
- Extremal combinatorics
- Template:Combin-stub
- Combinatorial design
- Plane partition
- Degree-constrained spanning tree
- Erdős–Burr conjecture
- Schnyder's theorem
- Colin de Verdière graph invariant
- Fraysseix–Rosenstiehl's planarity criterion
- Weighing matrix
- Zarankiewicz problem
- Claw-free permutation
- DIMACS
- Tree spanner
- Enumerative combinatorics
- Symmetric design
- Squarefree word
- Hoffman–Singleton graph
- Higman's lemma
- Inversive plane
- Milliken-Taylor theorem
- K-edge-connected graph
- Path coloring
- Szekeres snark
- Path decomposition
- Haven (graph theory)
- Incidence list
- Transpose graph
- Graph traversal
- Dipole graph
- Induced subgraph isomorphism problem
- K-vertex-connected graph
- Honest leftmost branch
- Maximal intersecting family
- T-theory
- Combinatorial explosion
- Higher spin alternating sign matrix
- Hamming graph
- Instant Insanity
- Graph toughness
- Kirkman's schoolgirl problem
- Kalmanson combinatorial conditions
- Spherical design
- Core (graph theory)
- Graph enumeration
- Ranked poset
- Wythoff's game
View more links to this file.
.svg&action=edit§ion=1){kind=link}
.svg&action=edit§ion=2){kind=link}
.svg&limit=20#filehistory){kind=link}
.svg&limit=50#filehistory){kind=link}
.svg&limit=100#filehistory){kind=link}
.svg&limit=250#filehistory){kind=link}
.svg&limit=500#filehistory){kind=link}
.svg){kind=link}
.svg){kind=link}
.svg){kind=link}
.svg&action=edit&redlink=1){kind=link}
.svg&action=edit){kind=link}
.svg){kind=link}
.svg&printable=yes){kind=link}