On the covering radius of binary codes (Corresp.)
- 1 September 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (5) , 627-628
- https://doi.org/10.1109/tit.1978.1055928
Abstract
Upper bounds on the covering radius of binary codes are studied. In particular it is shown that the covering radiusr_{m}of the first-order Reed-Muller code of lenglh2^{m}satisfies2^{m-l}-2^{lceil m/2 rceil -1} r_{m} leq 2^{m-1}-2^{m/2-1}.Keywords
This publication has 6 references indexed in Scilit:
- All binary 3-error-correcting BCH codes of length2^m-ihave covering radius 5 (Corresp.)IEEE Transactions on Information Theory, 1978
- On “bent” functionsJournal of Combinatorial Theory, Series A, 1976
- 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
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973
- Two-error correcting Bose-Chaudhuri codes are quasi-perfectInformation and Control, 1960