Decoding beyond the BCH bound (Corresp.)
- 1 May 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 18 (3), 441-444
- https://doi.org/10.1109/tit.1972.1054824
Abstract
In this correspondence, a decoding algorithm to decode beyond the BCH bound is introduced. It gives a complete minimum distance decoding for any cyclic code. A comparison between this decoding algorithm and previously existing ones is also given.Keywords
This publication has 2 references indexed in Scilit:
- A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.)IEEE Transactions on Information Theory, 1971
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codesIEEE Transactions on Information Theory, 1964