Binary codes with covering radius one: Some new lower bounds

Discrete Mathematics

Volumn 176, Issue 1-3, 1997, Pages 115-130

  Habsieger, Laurent ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039573798     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00290-7     Document Type: Article

References (11)

1. W. Chen and I.S. Honkala, Lower bounds for q-ary covering codes, IEEE Trans. Inform. Theory 36 (1990) 664-671.
2. G.D. Cohen, A.C. Lobstein and N.J.A. Sloane, Further results on the covering radius of codes, IEEE Trans. Inform. Theory 32 (1986) 680-694.
3. L. Habsieger, Lower bounds for q-ary coverings by spheres of radius one, J. Combin. Theory Ser. A 67 (1994) 199-222.
4. I.S. Honkala, Modified bounds for binary covering codes, IEEE Trans. Inform. Theory 37 (1991) 351-365.
5. I.S. Honkala, A lower bound on binary codes with covering radius one, in: Proc. Internat. Symp. on Information Theory & Its Applications, Sydney (1994) 39-41.
6. I.S. Honkala, Combinatorial lower bounds on binary codes with covering radius one, submitted.
7. G.J.M. Van Wee, Improved sphere bounds on the covering radius of codes, IEEE Trans. Inform. Theory 34 (1988) 237-245.
8. G.J.M. Van Wee, Bounds on packings and coverings by spheres in q-ary and mixed Hamming spaces, J. Combin. Theory Ser. A 57 (1991) 117-129.
9. G.J.M. Van Wee, Some new lower bounds for binary and ternary covering codes, IEEE Trans. Inform. Theory 39 (1993) 1422-1424.
10. Z. Zhang, Linear inequalities for covering codes: Part I - Pair covering inequalities, IEEE Trans. Inform. Theory 37 (1991) 573-582.
11. Z. Zhang and C. Lo, Linear inequalities for covering codes: Part II - Triple covering inequalities, IEEE Trans. Inform. Theory 38 (1992) 1648-1662.