Difference between revisions of "Template:Infobox code/doc"
Jump to navigation
Jump to search
imported>Vanisaac |
|||
| Line 1: | Line 1: | ||
{{Documentation subpage}} | {{Documentation subpage}} | ||
{{infobox code | {{infobox code | ||
| − | | name | + | | name = Reed–Solomon codes |
| − | | image | + | | image = |
| − | | image_caption | + | | image_caption = |
| − | | namesake | + | | namesake = [[Irving S. Reed]] and [[Gustave Solomon]] |
| − | | hierarchy | + | | hierarchy = [[Linear block code]]<br>[[Polynomial code]]<br>[[Cyclic code]]<br>[[BCH code]]<br>Reed–Solomon code |
| − | | block_length | + | | block_length = ''n'' = ''q'' − 1 |
| − | | message_length = ''k'' | + | | message_length = ''k'' |
| − | | distance | + | | distance = ''n'' − ''k'' + 1 |
| − | | alphabet_size | + | | alphabet_size = ''q'' = ''p''<sup>''m''</sup> (''p'' prime) |
| − | | notation | + | | notation = [''n'', ''k'', ''n'' − ''k'' + 1]<sub>''q''</sub>-code |
| − | | decoding | + | | decoding = [[Berlekamp–Massey algorithm|Berlekamp–Massey]]<br>[[Euclidean algorithm|Euclidean]]<br>''et al.'' |
| − | | properties | + | | properties = [[maximum distance separable code|Maximum-distance separable code]] |
}} | }} | ||
<pre>{{infobox code | <pre>{{infobox code | ||
| − | | name | + | | name = |
| − | | image | + | | image = |
| − | | image_caption | + | | image_caption = |
| − | | namesake | + | | namesake = |
| − | | type | + | | type = |
| − | | hierarchy | + | | hierarchy = |
| − | | block_length | + | | block_length = |
| − | | message_length = | + | | message_length = |
| − | | rate | + | | rate = |
| − | | distance | + | | distance = |
| − | | alphabet_size | + | | alphabet_size = |
| − | | notation | + | | notation = |
| − | | decoding | + | | decoding = |
| − | | properties | + | | properties = |
| − | | digits | + | | digits = |
| − | | tracks | + | | tracks = |
| − | | digit_values | + | | digit_values = |
| − | | weight | + | | weight = |
| − | | continuity | + | | continuity = |
| − | | cyclic | + | | cyclic = |
| − | | minimum_distance= | + | | minimum_distance = |
| − | | maximum_distance= | + | | maximum_distance = |
| − | | hamming_distance= | + | | hamming_distance = |
| − | | redundancy | + | | redundancy = |
| − | | lexicography | + | | lexicography = |
| − | | complement | + | | complement = |
| − | | groups_of_5 | + | | groups_of_5 = |
}}</pre> | }}</pre> | ||
Latest revision as of 19:16, 24 July 2020
| This is a documentation subpage for Template:Infobox code. It contains usage information, categories and other content that is not part of the original template page. |
| 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.