Difference between revisions of "Template:Infobox code/doc"
Jump to navigation
Jump to search
imported>Didym m (Reverted edits by Nethaji Sundarraju (talk) to last version by Ylloh) |
imported>Matthiaspaul (updated doc) |
||
| Line 29: | Line 29: | ||
| decoding = | | decoding = | ||
| properties = | | properties = | ||
| + | |||
| + | | digits = | ||
| + | | tracks = | ||
| + | | digit_values = | ||
| + | | weight = | ||
| + | | continuity = | ||
| + | | minimal_distance= | ||
| + | | maximal_distance= | ||
| + | | hamming_distance= | ||
| + | | redundancy = | ||
| + | | lexicographic = | ||
| + | | complement = | ||
| + | | group_of_5 = | ||
}}</pre> | }}</pre> | ||
Revision as of 18:12, 25 April 2017
| 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 =
| minimal_distance=
| maximal_distance=
| hamming_distance=
| redundancy =
| lexicographic =
| complement =
| group_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.