All binary 3-error-correcting BCH codes of length2^m-ihave covering radius 5 (Corresp.)
- 1 March 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (2) , 257-258
- https://doi.org/10.1109/tit.1978.1055847
Abstract
Van der Horst and Berger have conjectured that the covering radius of the binary 3-error-correcting Bose-Chaudhuri-Hocquenghem (BCH) code of length2^{m} - l, m geq 4is 5. Their conjecture was proved earlier whenm equiv 0, 1, or 3 (mod 4). Their conjecture is proved whenm equiv 2(mod 4).Keywords
This publication has 3 references indexed in Scilit:
- Some 3-error-correcting BCH codes have covering radius 5 (Corresp.)IEEE Transactions on Information Theory, 1976
- Complete decoding of triple-error-correcting binary BCH codesIEEE Transactions on Information Theory, 1976
- Coding TheoryLecture Notes in Mathematics, 1971