Lower bounds for q-ary codes of covering radius one

Discrete Mathematics

Volumn 219, Issue 1-3, 2000, Pages 97-106

  Haas, Wolfgang ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347647432     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00338-6     Document Type: Article

References (7)

1. G. Cohen, I.S. Honkala, S. Litsyn, A. Lobstein, Covering Codes, North-Holland Mathematical Library, Vol 54, Elsevier, Amsterdam, 1997.
2. L. Habsieger, Lower bounds for q-ary coverings by spheres of radius one, J. Combin. Theory Ser. A 67 (1994) 199-222.
3. L. Habsieger, Binary codes with covering radius one: some new lower bounds, Discrete Math. 176 (1997) 115-130.
4. L. Habsieger, Some new lower bounds for ternary covering codes, Electron. J. Combin. 3 (2) 1-14.
5. I.S. Honkala, Combinatorial lower bounds on binary codes with covering radius one, submitted for publication.
6. G. Losey, Note on theorem of Zaremba, J. Combin. Theory Ser. A 6 (1969) 208-209.
7. 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.