A new construction for covering codes
- 1 September 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (5) , 1343-1344
- https://doi.org/10.1109/18.21265
Abstract
A novel method for constructing normal binary nonlinear covering codes is presented. The construction improves several upper bounds on K(n,R), the minimum cardinality of a binary code of length n and covering radius RKeywords
This publication has 3 references indexed in Scilit:
- Improved sphere bounds on the covering radius of codesIEEE Transactions on Information Theory, 1988
- Some lower bounds for constant weight codesDiscrete Applied Mathematics, 1987
- Further results on the covering radius of codesIEEE Transactions on Information Theory, 1986