Title :
Decoding of alternant codes (Corresp.)
Author :
Helgert, Hermann J.
fDate :
7/1/1977 12:00:00 AM
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 :
BCH codes; Decoding; Error-correcting codes; Goppa codes; Srivastava codes; Aircraft; Artificial satellites; Binary sequences; Circuits and systems; Decoding; Digital systems; Gold; Parity check codes; Relays; Spread spectrum communication;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1977.1055730
