Image: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.
|
[edit] Summary
| Description |
A Rotary Encoder Disc with a 3-Bit Binary Reflected Gray Code (BRGC). |
|---|---|
| Source |
Replacement for Image:Encoder_disc.png |
| Date |
22/05/06 |
| Author |
jjbeard |
| Permission (Reusing this image) |
PD |
| Other versions | Image:Encoder_disc.png |
[edit] Licensing
 |
I, the copyright holder of this work, hereby release it into the public domain. This applies worldwide. In case this is not legally possible: Afrikaans | Alemannisch | Aragonés | العربية | Asturianu | Български | Català | Česky | Cymraeg | Dansk | Deutsch | Eʋegbe | Ελληνικά | English | Español | Esperanto | Euskara | Estremeñu | فارسی | Français | Galego | 한국어 | हिन्दी | Hrvatski | Ido | Bahasa Indonesia | Íslenska | Italiano | עברית | Kurdî / كوردی | Latina | Lietuvių | Latviešu | Magyar | Македонски | Bahasa Melayu | Nederlands | Norsk (bokmål) | Norsk (nynorsk) | 日本語 | Polski | Português | Ripoarisch | Română | Русский | Shqip | Slovenčina | Slovenščina | Српски / Srpski | Svenska | ไทย | Tagalog | Türkçe | Українська | Tiếng Việt | Walon | 中文(简体) | 中文(繁體) | zh-yue-hant | +/- |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | 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
- Containment hierarchy
- Disperser
- Steiner system
- Gray code
- Algebraic enumeration
- Combinatorial 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
- Cubic graph
- Analytic combinatorics
- Hall–Janko graph
- Steiner points
- K-minimum spanning tree
- Menger's theorem
- Graph rewriting
- Random minimal spanning tree
- Bridge (graph theory)
- Broken space diagonal
- Rooted graph
- Strongly regular graph
- Pandiagonal magic cube
- Transportation network (graph theory)
- Visibility graph analysis
- Circuit rank
- Vertex separator
- Null graph
- Symmetric graph
- Combinatorial principles
- Rule of sum
- Rule of product
- Toroidal graph
- Tutte theorem
- Arc-transitive graph
- Biadjacency matrix
- Cycle decomposition
- Metric dimension (graph theory)
- Multigraph
- Network (mathematics)
- AF-heap
- Monochromatic triangle
- Cut vertex
- Szemerédi regularity lemma
- Costas array
- 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
- Claw-free permutation
- DIMACS
- Tree spanner
- Symmetric design
- Hoffman–Singleton graph
- Higman's lemma
- Inversive plane
- Milliken-Taylor theorem
- K-edge-connected graph
- Path coloring
- Primal graph
- Szekeres snark
- Path decomposition
- Haven (graph theory)
- Welch-Costas array
- Transpose graph
- Graph traversal
- Dipole graph
- Induced subgraph isomorphism problem
- K-vertex-connected graph
- Honest leftmost branch
- Maximal intersecting family
- T-theory
- Distance-transitive graph
- Combinatorial explosion
- Higher spin alternating sign matrix
View more links to this file.
