More binary covering codes are normal
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (6) , 1466-1470
- https://doi.org/10.1109/18.59947
Abstract
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves a conjecture of Cohen, Lobstein, and Sloane (1986). It is also proved that codes with minimal distance 2R or 2R+1 are normal. A generalization of Frankl's construction (1987) of abnormal codes is givenKeywords
This publication has 14 references indexed in Scilit:
- Modified bounds for covering codesIEEE Transactions on Information Theory, 1991
- Some results on the norm of codesIEEE Transactions on Information Theory, 1990
- On normal and subnormal q-ary codesIEEE Transactions on Information Theory, 1989
- A new construction for covering codesIEEE Transactions on Information Theory, 1988
- Improved sphere bounds on the covering radius of codesIEEE Transactions on Information Theory, 1988
- Lower bounds for binary covering codesIEEE Transactions on Information Theory, 1988
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal CodesSIAM Journal on Algebraic Discrete Methods, 1987
- A new approach to the covering radius of codesJournal of Combinatorial Theory, Series A, 1986
- On the covering radius of codesIEEE Transactions on Information Theory, 1985
- Introduction to Coding TheoryPublished by Springer Nature ,1982