Decoding of alternant codes (Corresp.)
- 1 July 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (4) , 513-514
- https://doi.org/10.1109/tit.1977.1055730
Abstract
It is shown that the only modification of the Berlekamp algorithm required to decode the class of alternant codes consists of a linear transformation of the syndromes prior to the application of the algorithm. Since alternant codes include all Bose-Chaudhuri-Hocquenghem (BCH) and Goppa codes, the Chien-Choy generalized BCH codes, and the generalized Srivastava codes, all of these can be decoded with no increase in complexity over BCH decoding.Keywords
This publication has 3 references indexed in Scilit:
- Algebraic generalization of BCH-Goppa-Helgert codesIEEE Transactions on Information Theory, 1975
- Decoding Goppa codes with a BCH decoder (Corresp.)IEEE Transactions on Information Theory, 1975
- Alternant codesInformation and Control, 1974