All binary codes with covering radius one are subnormal
- 29 November 1991
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 94 (3) , 229-232
- https://doi.org/10.1016/0012-365x(91)90028-z
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Bounds for abnormal binary codes with covering radius oneIEEE Transactions on Information Theory, 1991
- Modified bounds for covering codesIEEE Transactions on Information Theory, 1991
- More binary covering codes are normalIEEE Transactions on Information Theory, 1990
- On normal and subnormal q-ary codesIEEE Transactions on Information Theory, 1989
- 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
- Further results on the covering radius of codesIEEE Transactions on Information Theory, 1986
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- On the covering radius of codesIEEE Transactions on Information Theory, 1985