A New Table of Binary/Ternary Mixed Covering Codes

Designs, Codes, and Cryptography

Volumn 11, Issue 2, 1997, Pages 151-178

  Östergård, Patric R J ^a   Hämäläinen, Heikki O ^a,b  

^a AALTO UNIVERSITY   (Finland)

^b NONE   (Finland)

Author keywords

Covering codes; Football pool problem; Mixed codes; Simulated annealing

Indexed keywords

EID: 0346440608     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008228721072     Document Type: Article

References (41)

1. A. Blokhuis and C. W. H. Lam, More coverings by rook domains, J. Combin. Theory Ser. A, Vol. 36 (1984) pp. 240-244.
2. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, A new table of constant weight codes, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 1334-1380.
3. W. A. Carnielli, On covering and coloring problems for rook domains, Discrete Math., Vol. 57 (1985) pp. 9-16.
4. W. Chen and I. S. Honkala, Lower bounds for q-ary covering codes, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 664-671.
5. G. D. Cohen, M. G. Karpovsky, H. F. Mattson, Jr., and J. R. Schatz, Covering radius - survey and recent results, IEEE Trans. Inform. Theory, Vol. 31 (1985) pp. 328-343.
6. G. D. Cohen, A. C. Lobstein, and N. J. A. Sloane, Further results on the covering radius of codes, IEEE Trans. Inform. Theory, Vol. 32 (1986) pp. 680-694.
7. R. Davies and G. F. Royle, Graph domination, tabu search and the football pool problem, Discrete Appl. Math, to appear.
8. T. Etzion and G. Greenberg, Constructions for perfect mixed codes and other covering codes, IEEE Trans. Inform. Theory, Vol. 39 (1993) pp. 209-214.
9. G. Exoo, personal communication.
10. S. W. Golomb and E. C. Posner, Rook domains, Latin squares, affine planes, and error-distributing codes, IEEE Trans. Inform. Theory, Vol. 10 (1964) pp. 196-208.
11. R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory, Vol. 31 (1985) pp. 385-401.
12. H. O. Hämäläinen, I. S. Honkala, M. K. Kaikkonen, and S. N. Litsyn, Bounds for binary multiple covering codes, Des. Codes Cryptogr., Vol. 3 (1993) pp. 251-275.
13. H. Hämäläinen and S. Rankinen, Upper bounds for football pool problems and mixed covering codes, J. Combin. Theory Ser. A, Vol. 56 (1991) pp. 84-95.
14. M. Herzog and J. Schönheim, Linear and nonlinear single-error-correcting perfect mixed codes, Inform. and Control, Vol. 18 (1971) pp. 364-368.
15. I. S. Honkala, On (k, t)-subnormal covering codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 1203-1206.
16. I. S. Honkala, On (q, 1)-subnormal q-ary covering codes, Discrete Appl. Math., Vol. 52 (1994) pp. 213-221.
17. I. S. Honkala and H. O. Hämäläinen, A new construction for covering codes, IEEE Trans. Inform. Theory, Vol. 34 (1988) pp. 1343-1344.
18. J. G. Kalbfleisch and R. G. Stanton, A combinatorial theorem in matching, J. London Math. Soc. (1), Vol. 44 (1969) pp. 60-64; and (2), Vol. 1 (1969) p. 398.
19. J. G. Kalbfleisch and R. G. Stanton, A combinatorial theorem in matching, J. London Math. Soc. (1), Vol. 44 (1969) pp. 60-64; and (2), Vol. 1 (1969) p. 398.
20. H. J. L. Kamps and J. H. van Lint, The football pool problem for 5 matches, J. Combin. Theory, Vol. 3 (1967) pp. 315-325.
21. H. J. L. Kamps and J. H. van Lint, A covering problem, Colloq. Math. Soc. János Bolyai, Vol. 4 (1970) pp. 679-685.
22. E. Kolev and I. Landgev, On some mixed covering codes of small length, Algebraic Coding (G. Cohen, S. Litsyn, A. Lobstein, and G. Zémor, eds.), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 781 (1994) pp. 38-50.
23. P. J. M. van Laarhoven, E. H. L. Aarts, J. H. van Lint, and L. T. Wille, New upper bounds for the football pool problem for 6, 7, and 8 matches, J. Combin. Theory Ser. A, Vol. 52 (1989) pp. 304-312.
24. B. Lindström, Group partitions and mixed perfect codes, Canad. Math. Bull., Vol. 18 (1975) pp. 57-60.
25. J. H. van Lint Jr. and G. J. M. van Wee, Generalized bounds on binary/ternary mixed packing- and covering codes, J. Combin. Theory Ser. A, Vol. 57 (1991) pp. 130-143.
26. J. H. van Lint Jr., Covering Radius Problems, M.Sc. thesis, Eindhoven University of Technology (1988).
27. P. R. J. Östergård, A new binary code of length 10 and covering radius 1, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 179-180.
28. P. R. J. "Östergård, Upper bounds for q-ary covering codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 660-664; and Vol. 37 (1991) p. 1738.
29. P. R. J. "Östergård, Upper bounds for q-ary covering codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 660-664; and Vol. 37 (1991) p. 1738.
30. P. R. J. Östergård, Further results on (k, t)-subnormal covering codes, IEEE Trans. Inform. Theory, Vol. 38 (1992) pp. 206-210.
31. P. R. J. Östergård, Construction methods for mixed covering codes, 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.
32. P. R. J. Östergård, New upper bounds for the football pool problem for 11 and 12 matches, J. Combin. Theory Ser. A, Vol. 67 (1994) pp. 161-168.
33. P. R. J. Östergård, The football pool problem, Congr. Numer., Vol. 114 (1996) pp. 33-43.
34. P. R. J. Östergård, Constructing covering codes by tabu search, J. Combin. Des., Vol. 5 (1997) pp. 71-80.
35. P. R. J. Östergård, A coloring problem in Hamming spaces, European J. Combin., to appear.
36. C. A. Rogers, Packing and Covering, Camb. Univ. Press, Cambridge (1964).
37. A. Schrijver (ed.), Packing and Covering in Combinatorics, M. C. Tracts 106, Amsterdam: Matematisch Centrum (1979).
38. R. G. Stanton and J. A. Bate, A computer search for B-coverings, Combinatorial Mathematics VII (R. W. Robinson, G. W. Southern, and W. D. Wallis, eds.), Lecture Notes in Mathematics, Springer-Verlag, Berlin, 829 (1980) pp. 37-50.
39. G. J. M. van Wee, On the non-existence of certain perfect mixed codes. Discrete Math., Vol. 87 (1991) pp. 323-326.
40. L. T. Wille, The football pool problem for 6 matches: a new upper bound obtained by simulated annealing, J. Combin. Theory Ser. A, Vol. 45 (1987) pp. 171-177.
41. L. T. Wille, New binary covering codes obtained by simulated annealing, IEEE Trans. Inform. Theory, Vol. 42 (1996) pp. 300-302.