Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
- 1 March 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 20 (2) , 292-295
- https://doi.org/10.1109/tit.1974.1055178
Abstract
Many cyclic codes are generated by polynomials possessing more than one set of consecutive roots. Thus more than one set of syndrome sequences are available for decoding. In this correspondence, a decoding method based on Berlekamp's iterative algorithm is presented which makes use of the multiple sets of syndrome sequences for decoding such cyclic codes beyond the BCH bound.Keywords
This publication has 6 references indexed in Scilit:
- Generalizations of the BCH boundInformation and Control, 1972
- Decoding beyond the BCH bound (Corresp.)IEEE Transactions on Information Theory, 1972
- Some results on the minimum distance structure of cyclic codesIEEE Transactions on Information Theory, 1972
- Block-Coding Techniques for Reliable Data TransmissionIEEE Transactions on Communication Technology, 1971
- On the minimum distance of certain reversible cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codesIEEE Transactions on Information Theory, 1964