New lower bounds for covering codes

Discrete Mathematics

Volumn 222, Issue 1-3, 2000, Pages 125-149

  Habsieger, L ^a   Plagne, A ^a,b  

^a CNRS   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Covering code; Linear inequality; Lower bound

Indexed keywords

EID: 0345754944     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00011-X     Document Type: Article

References (14)

1. R.C. Bose, D.M. Mesner, On linear associative algebras corresponding to association schemes of partially balanced designs, Ann. Math. Statist. 30 (1959) 21-38.
2. A.E. Brouwer, T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory 39 (1993) 662-677.
3. G.D. Cohen, I.S. Honkala, S. Litsyn, A.C. Lobstein, Covering Codes, North-Holland, Amsterdom, 1997.
4. L. Habsieger, Some new lower bounds for ternary covering codes, Electron. J. Combin., http:// ejc.math.gatech.edu: 8080/ejc.math.gatech.edu: 8080/Journal/volume3/festschrift. html, 1996.
5. L. Habsieger, A. Plagne, Nouvelles inégalités linéaires pour les codes de recouvrement, manuscript, 604 pp., available at http://ultralix.polytechnique.fr/~plagne/annexe1.ps, 1998.
6. L. Habsieger, A. Plagne, Application des inégalités linéaires aux codes linéaires, manuscript, 38 pp., available at http://ultralix.polytechnique. fr/~plagne/annexe2.ps, 1998.
7. I.S. Honkala, Modified bounds for covering codes, IEEE Trans. Inform. Theory 37 (1991) 351-365.
8. S.M. Johnson, A new lower bound for coverings by rook domains, Utilitas Math. 1 (1972) 121-140.
9. D. Li, W. Chen, New lower bounds for binary covering codes, IEEE Trans. Inform. Theory 40 (1994) 1122-1129.
10. S. Litsyn, Table of the best currently known lower and upper bounds on the smallest size of a covering code, available at http://www.eng.tau.ac.il/~litsyn/tablecr/index.html.
11. A. Plagne, Points entiers sur les courbes strictement convexes, sommes de sous-ensembles et codes de recouvrement, Ph.D. Thesis, Université Bordeaux I, 1998. (Chapter 4).
12. G.J.M. van Wee, Improved sphere bounds on the covering radius of codes, IEEE Trans. Inform. Theory 34 (1988) 237-245.
13. Z. Zhang, Linear inequalities for covering codes: part I - pair covering inequalities, IEEE Trans. Inform. Theory 37 (1991) 573-582.
14. Z. Zhang, C. Lo, Linear inequalities for covering codes: part II - triple covering inequalities, IEEE Trans. Inform. Theory 38 (1992) 1648-1662.