On (k, t)-subnormal covering codes
- 1 July 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (4) , 1203-1206
- https://doi.org/10.1109/18.86975
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- All binary codes with covering radius one are subnormalDiscrete Mathematics, 1991
- Bounds on packings and coverings by spheres inq-ary and mixed Hamming spacesJournal of Combinatorial Theory, Series A, 1991
- Upper bounds for q-ary covering codesIEEE Transactions on Information Theory, 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
- A new binary code of length 10 and covering radius 1IEEE 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
- Lower bounds for binary covering codesIEEE Transactions on Information Theory, 1988
- On the covering radius of codesIEEE Transactions on Information Theory, 1985