Complete decoding of triple-error-correcting binary BCH codes
- 1 March 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 22 (2), 138-147
- https://doi.org/10.1109/tit.1976.1055530
Abstract
An extensive study of binary triple-error-correcting codes of primitive lengthn = 2^{m} - 1is reported that results in a complete decoding algorithm whenever the maximum coset weightW_{max}is five. In this regard it is shown thatW_{max} = 5when four dividesm, and strong support is provided for the validity of the conjecture thatW_{max} = 5for allm. The coset weight distribution is determined exactly in some cases and bounded in others.Keywords
This publication has 4 references indexed in Scilit:
- Decoding beyond the BCH bound (Corresp.)IEEE Transactions on Information Theory, 1972
- A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.)IEEE Transactions on Information Theory, 1971
- On the solution of algebraic equations over finite fieldsInformation and Control, 1967
- Two-error correcting Bose-Chaudhuri codes are quasi-perfectInformation and Control, 1960