Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (6) , 1716-1723
- https://doi.org/10.1109/18.104340
Abstract
The decoding capabilities of algebraic algorithms, mainly the Berlekamp-Massey algorithm, the Euclidean algorithm, and the authors' (1989) generalizations of these algorithms, are basically constrained by the minimum distance bounds of the codes. The authors introduce a more general procedure which breaks away from this restriction and which can determine the, error locations from nonrecurrent dependence relations among the syndromes. It can decode many cyclic and BCH codes up to their actual minimum distance and is seen to be a generalization of the procedure introduced by W.W. Peterson and E.J. Weldon (1972)Keywords
This publication has 13 references indexed in Scilit:
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codesIEEE Transactions on Information Theory, 1991
- Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e>e/sub BCH/IEEE Transactions on Information Theory, 1990
- A generalized Euclidean algorithm for multisequence shift-register synthesisIEEE Transactions on Information Theory, 1989
- Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacitiesIEEE Transactions on Information Theory, 1988
- Algebraic decoding of the (23,12,7) Golay code (Corresp.)IEEE Transactions on Information Theory, 1987
- On the minimum distance of cyclic codesIEEE Transactions on Information Theory, 1986
- Multisequence Linear Shift Register Synthesis and Its Application to BCH DecodingIEEE Transactions on Communications, 1976
- A method for solving key equation for decoding goppa codesInformation and Control, 1975
- Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)IEEE Transactions on Information Theory, 1974
- Generalizations of the BCH boundInformation and Control, 1972