Back to Search
Start Over
Several new lower bounds on the size of codes with covering radius one
- Source :
- IEEE Transactions on Information Theory. Sept, 1998, Vol. v44 Issue n5, p1998, 4 p.
- Publication Year :
- 1998
-
Abstract
- We derive several new lower bounds on the size of binary codes with covering radius one. In particular, we prove K(9. 1) [greater than or equal to] 57 (the best known lower bound was 55) and K(11, 1) [greater than or equal to] 180 (178). Index Terms - Covering codes, lower bounds.
Details
- ISSN :
- 00189448
- Volume :
- v44
- Issue :
- n5
- Database :
- Gale General OneFile
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.21068502