A coloring problem in Hamming spaces

European Journal of Combinatorics

Volumn 18, Issue 3, 1997, Pages 303-309

  Östergård, Patric R J ^a,b  

^a UNIVERSITY OF TURKU   (Finland)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444448972     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0093     Document Type: Article

References (19)

1. R. A. Brualdi and V. S. Pless, On the length of codes with a given covering radius, in: Coding Theory and Design Theory. Part I: Coding Theory, D. Ray-Chauduri (ed.), Springer-Verlag, New York, 1990, pp. 9-15.
2. W. A. Carnielli, On covering and coloring problems for rook domains, Discr. Math., 57 (1985), 9-16.
3. G. J. Chang, The domatic number problem, Discr. Math., 125 (1994), 115-122.
4. E. J. Cockayne and S. T. Hedetniemi, Towards a theory of domination in graphs, Networks, 7 (1977), 247-261.
5. 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.
6. T. Etzion and G. Greenberg, Constructions for perfect mixed codes and other covering codes, IEEE Trans. Inform. Theory, 39 (1993), 209-214.
7. S. W. Golomb and E. C. Posner, Rook domains, Latin squares, affine planes, and error-distributing codes, IEEE Trans. Inform. Theory, 10 (1964), 196-208.
8. R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory, 31 (1985), 385-401.
9. I. S. Honkala, On (k, t)-subnormal covering codes, IEEE Trans. Inform. Theory, 37 (1991), 1203-1206.
10. M. N. Huxley, The Distribution of Prime Numbers, Clarendon Press, Oxford, 1972.
11. G. A. Kabatyanskii and V. I. Panchenko, Unit sphere packings and coverings of the Hamming space, Problemy Peredachi Informatsii, 24 (1988), 3-16 (in Russian); English translation in Problems Inform. Transmission, 24 (1988), 261-272.
12. G. A. Kabatyanskii and V. I. Panchenko, Unit sphere packings and coverings of the Hamming space, Problemy Peredachi Informatsii, 24 (1988), 3-16 (in Russian); English translation in Problems Inform. Transmission, 24 (1988), 261-272.
13. J.-M. Laborde, Sur le nombre domatique du n-cube et une conjecture de Zelinka, Europ. J. Combin., 8 (1987), 175-177.
14. D. Li and W. Chen, New lower bounds for binary covering codes, IEEE Trans. Inform. Theory, 40 (1994), 1122-1129.
15. P. R. J. Östergård, Further results on (k, t)-subnormal covering codes, IEEE Trans. Inform. Theory, 38 (1992), 206-210.
16. P. R. J. Östergård, Construction methods for mixed covering codes, in: Analysis, Algebra and Computers in Mathematical Research: Proceedings of the Twenty-first Nordic Congress of Mathematicians, M. Gyllenberg and L. E. Persson (eds), Marcel Dekker, New York, 1994, pp. 387-408.
17. B. Zelinka, Domatic numbers of cube graphs, Math. Slovaca, 32 (1982), 117-119.
18. B. Zelinka, On k-domatic numbers of graphs, Czech. Math. J., 33 (1983), 309-311.
19. B. Zelinka, Domination in cubes, Math. Slovaca, 41 (1991), 17-19.