Difference between revisions of "Template:Infobox code"
Jump to navigation
Jump to search
[[Category:Infobox templates|Template:Remove first word]]
imported>Matthiaspaul (refinements) |
imported>Matthiaspaul (+links) |
||
| Line 35: | Line 35: | ||
|label21=Tracks<!-- Lesespuren --> | |label21=Tracks<!-- Lesespuren --> | ||
|data21={{{tracks|}}} | |data21={{{tracks|}}} | ||
| − | |label22=Digit | + | |label22=[[Digit value]]s<!-- Stellenwerte / bewertbar --> |
|data22={{{digit_values|}}} | |data22={{{digit_values|}}} | ||
|label23=[[Hamming weight|Weight(s)]]<!-- Gewichte --> | |label23=[[Hamming weight|Weight(s)]]<!-- Gewichte --> | ||
| Line 41: | Line 41: | ||
|label24=Continuity<!-- Stetigkeit / Einschrittigkeit / zyklisch (veraltet) --> | |label24=Continuity<!-- Stetigkeit / Einschrittigkeit / zyklisch (veraltet) --> | ||
|data24={{{continuity|}}} | |data24={{{continuity|}}} | ||
| − | |label25=Minimum distance | + | |label25=[[Hamming distance|Minimum distance]] |
|data25={{{minimum_distance|}}} | |data25={{{minimum_distance|}}} | ||
| − | |label26=Maximum distance | + | |label26=Maximum distance |
|data26={{{maximum_distance|}}} | |data26={{{maximum_distance|}}} | ||
| − | |label27=Hamming distance | + | |label27=[[Hamming distance]] |
|data27={{{hamming_distance|}}} | |data27={{{hamming_distance|}}} | ||
| − | |label28=Redundancy | + | |label28=[[Redundancy (information theory)|Redundancy]] |
|data28={{{redundancy|}}} | |data28={{{redundancy|}}} | ||
| − | |label29=[[Lexicographical order|Lexicography]] | + | |label29=[[Lexicographical order|Lexicography]] |
|data29={{{lexicography|}}} | |data29={{{lexicography|}}} | ||
| − | |label30=Complement | + | |label30=[[Radix complement|Complement]] |
|data30={{{complement|}}} | |data30={{{complement|}}} | ||
|label31=Groups of 5<!-- 5er Bündel --> | |label31=Groups of 5<!-- 5er Bündel --> | ||
Revision as of 02:27, 2 May 2017
| Reed–Solomon codes | |
|---|---|
| Named after | Irving S. Reed and Gustave Solomon |
| Classification | |
| Hierarchy | Linear block code Polynomial code Cyclic code BCH code Reed–Solomon code |
| Block length | n = q − 1 |
| Message length | k |
| Distance | n − k + 1 |
| Alphabet size | q = pm (p prime) |
| Notation | [n, k, n − k + 1]q-code |
| Algorithms | |
| Berlekamp–Massey Euclidean et al. | |
| Properties | |
| Maximum-distance separable code | |
{{infobox code
| name =
| image =
| image_caption =
| namesake =
| type =
| hierarchy =
| block_length =
| message_length =
| rate =
| distance =
| alphabet_size =
| notation =
| decoding =
| properties =
| digits =
| tracks =
| digit_values =
| weight =
| continuity =
| cyclic =
| minimum_distance =
| maximum_distance =
| hamming_distance =
| redundancy =
| lexicography =
| complement =
| groups_of_5 =
}}
- Any of the fields can be safely left blank.
- You may include an image with no caption, but a caption will not be shown if there is no image.
- Wiki links [[]] are fine in any of the fields.
| The above documentation is transcluded from Template:Infobox code/doc. (edit | history) Editors can experiment in this template's sandbox (create | mirror) and testcases (create) pages. Please add categories to the /doc subpage. Subpages of this template. |