Alternant code: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (New article, my own wording from Wikipedia) |
imported>Richard Pinch (remove WPmarkup; subpages) |
||
| Line 1: | Line 1: | ||
{{subpages}} | |||
In [[coding theory]], '''alternant codes''' form a class of parameterised [[Error detection and correction|error-correcting codes]] which generalise the [[BCH code]]s. | In [[coding theory]], '''alternant codes''' form a class of parameterised [[Error detection and correction|error-correcting codes]] which generalise the [[BCH code]]s. | ||
| Line 15: | Line 16: | ||
== References == | == References == | ||
* {{cite book | author=F.J. MacWilliams | authorlink=Jessie MacWilliams | coauthors=N.J.A. Sloane | title=The Theory of Error-Correcting Codes | publisher=North-Holland | date=1977 | isbn=0-444-85193-3 | pages=332-338 }} | * {{cite book | author=F.J. MacWilliams | authorlink=Jessie MacWilliams | coauthors=N.J.A. Sloane | title=The Theory of Error-Correcting Codes | publisher=North-Holland | date=1977 | isbn=0-444-85193-3 | pages=332-338 }} | ||
Revision as of 14:15, 29 October 2008
In coding theory, alternant codes form a class of parameterised error-correcting codes which generalise the BCH codes.
Definition
An alternant code over GF(q) of length n is defined by a parity check matrix H of alternant form Hi,j = αjiyi, where the αj are distinct elements of the extension GF(qm), the yi are further non-zero parameters again in the extension GF(qm) and the indices range as i from 0 to δ-1, j from 1 to n.
Properties
The parameters of this alternant code are length n, dimension ≥ n-mδ and minimum distance ≥ δ+1. There exist long alternant codes which meet the Gilbert-Varshamov bound.
The class of alternant codes includes
References
- F.J. MacWilliams; N.J.A. Sloane (1977). The Theory of Error-Correcting Codes. North-Holland, 332-338. ISBN 0-444-85193-3.