Bounds for abnormal binary codes with covering radius one
- 1 March 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (2) , 372-375
- https://doi.org/10.1109/18.75256
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- All binary codes with covering radius one are subnormalDiscrete Mathematics, 1991
- Modified bounds for covering codesIEEE Transactions on Information Theory, 1991
- Upper bounds for football pool problems and mixed covering codesJournal of Combinatorial Theory, Series A, 1991
- More binary covering codes are normalIEEE Transactions on Information Theory, 1990
- On normal and subnormal q-ary codesIEEE Transactions on Information Theory, 1989
- 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
- On the covering radius of codesIEEE Transactions on Information Theory, 1985