New upper bounds for binary covering codes

Discrete Mathematics

Volumn 178, Issue 1-3, 1998, Pages 165-179

  Östergård, Patric R J ^a,c   Kaikkonen, Markku K ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b Halkosuonntie 65 C 5   (Finland)

^c AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037749756     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)81825-0     Document Type: Article

References (47)

1. A. Blokhuis and C.W.H. Lam, More coverings by rook domains, J. Combin. Theory Ser. A 36 (1984) 240-244.
2. R.A. Brualdi and V.S. Pless, On the length of codes with a given covering radius, in: D. Ray-Chauduri, ed., Coding Theory and Design Theory; Part I: Coding Theory (Springer, New York, 1990) 9-15.
3. G.D. Cohen, M.G. Karpovsky, H.F. Mattson Jr. and J.R. Schatz, Covering radius - Survey and recent results, IEEE Trans. Inform. Theory 31 (1985) 328-343.
4. G.D. Cohen, S.N. Litsyn, A.C. Lobstein and H.F. Mattson Jr., Covering radius 1985-1994, Appl. Algebra Eng. Commun. Comput., to appear.
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. A.A. Davydov, Construction of linear covering codes (in Russian), Problemy Peredachi Informatsii 26 (4) (1990) 38-55. English translation in Problems Inform. Transmission 26 (4) (1990) 317-331.
7. A.A. Davydov, Construction of linear covering codes (in Russian), Problemy Peredachi Informatsii 26 (4) (1990) 38-55. English translation in Problems Inform. Transmission 26 (4) (1990) 317-331.
8. T. Etzion and G. Greenberg, Constructions for perfect mixed codes and other covering codes, IEEE Trans. Inform. Theory 39 (1993) 209-214.
9. G. Exoo, personal communication.
10. E.M. Gabidulin, A.A. Davydov and L.M. Tombak, Linear codes with covering radius 2 and other new covering codes, IEEE Trans. Inform. Theory 37 (1991) 219-224.
11. F. Glover, Tabu search - Part I, ORSA J. Comput. 1 (1989) 190-206.
12. 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.
13. R.L. Graham and N.J.A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory 31 (1985) 385-401.
14. H.O. Hämäläinen, I.S. Honkala, M.K. Kaikkonen and S.N. Litsyn, Bounds for binary multiple covering codes, Designs Codes Cryptogr. 3 (1993) 251-275.
15. H.O. Hämäläinen, I.S. Honkala, S.N. Litsyn and P.R.J. Östergård, Bounds for binary codes that are multiple coverings of the farthest-off points, SIAM J. Discrete Math. 8 (1995) 196-207.
16. I.S. Honkala, Lower bounds for binary covering codes, IEEE Trans. Inform. Theory 34 (1988) 326-329.
17. I.S. Honkala, Modified bounds for covering codes, IEEE Trans. Inform. Theory 37 (1991) 351-365.
18. I.S. Honkala, On (k, t)-subnormal covering codes, IEEE Trans. Inform. Theory 37 (1991) 1203-1206.
19. I.S. Honkala and H.O. Hämäläinen, A new construction for covering codes, IEEE Trans. Inform. Theory 34 (1988) 1343-1344.
20. I.S. Honkala and P.R.J. Östergård, Applications in code design, in: E.H.L. Aarts and J.K. Lenstra, eds., Local Search in Combinatorial Optimization (Wiley, New York), to appear.
21. X.-D. Hou, Some results on the norm of codes, IEEE Trans. Inform. Theory 36 (1990) 683-685.
22. S.M. Johnson, A new lower bound for coverings by rook domains, Utilitas Math. 1 (1972) 121-140.
23. G.A. Kabatyanskii and V.I. Panchenko, Unit sphere packings and coverings of the Hamming space (in Russian), Problemy Peredachi Informatsii 24 (4) (1988) 3-16. English translation in Problems Inform. Transmission 24 (4) (1988) 261-272.
24. G.A. Kabatyanskii and V.I. Panchenko, Unit sphere packings and coverings of the Hamming space (in Russian), Problemy Peredachi Informatsii 24 (4) (1988) 3-16. English translation in Problems Inform. Transmission 24 (4) (1988) 261-272.
25. J.G. Kalbfleisch, R.G. Stanton and J. D. Horton, On covering sets and error-correcting codes, J. Combin. Theory 11 (1971) 233-250.
26. S. Kirkpatrick, C.D. Gelatt Jr. and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
27. D. Li and W. Chen, New lower bounds for binary covering codes, IEEE Trans. Inform. Theory 40 (1994) 1122-1129.
28. B. Lindström, Group partitions and mixed perfect codes, Canad. Math. Bull. 18 (1975) 57-60.
29. A. Lobstein and V. Pless, The length function: a revised table, in: G. Cohen, S. Litsyn, A. Lobstein and G. Zémor, eds., Algebraic Coding; Proc. 1st French-Israeli Workshop Paris 1993, Lecture Notes in Computer Science, vol. 781 (Springer, Berlin, 1994) 51-55.
30. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1977).
31. P.R.J. Östergård, A new binary code of length 10 and covering radius 1, IEEE Trans. Inform. Theory 37 (1991) 179-180.
32. P.R.J. Östergård, Upper bounds for q-ary covering codes, IEEE Trans. Inform. Theory 37 (1991) 660-664; 37 (1991) 1738.
33. P.R.J. Östergård, Upper bounds for q-ary covering codes, IEEE Trans. Inform. Theory 37 (1991) 660-664; 37 (1991) 1738.
34. P.R.J. Östergård, Further results on (k, t)-subnormal covering codes, IEEE Trans. Inform. Theory 38 (1992) 206-210.
35. P.R.J. Östergård, Construction methods for covering codes, Ph.D. Dissertation, Research Report A 25, Digital Systems Laboratory, Helsinki University of Technology, Finland, 1993.
36. P.R.J. Östergård, On the construction of mixed covering codes, in: M. Gyllenberg and L.E. Persson, eds, Analysis, Algebra, and Computers in Mathematical Research; Proc. 21st Nordic Congress of Mathematicians (Marcel Dekker, New York, 1994) 387-408.
37. P.R.J. Östergård, A coloring problem in Hamming spaces, European J. Combin., to appear.
38. P.R.J. Östergård, Constructing covering codes by tabu search, J. Combin. Designs, to appear.
39. P.R.J. Östergård and H.O. Hämäläinen, A new table of binary/ternary mixed covering codes, Designs Codes Cryptogr., to appear.
40. P.R.J. Östergård and M.K. Kaikkonen, New single-error-correcting codes, IEEE Trans. Inform. Theory 42 (1996) 1261-1262.
41. P.R.J. Östergård and W.D. Weakley, Constructing covering codes with given automorphisms, submitted for publication.
42. R.G. Stanton, J.D. Horton and J.G. Kalbfleisch, Covering theorems for vectors with special reference to the case of four and five components, J. London Math. Soc. (2) 1 (1969) 493-499.
43. R.G. Stanton and J.G. Kalbfleisch, Covering problems for dichotomized matchings, Aequationes Math. 1 (1968) 94-103.
44. R. Struik, Covering codes, Ph.D. Dissertation, Eindhoven University of Technology, The Netherlands, 1994.
45. J.H. van Lint Jr., Covering radius problems, Master's Thesis, Eindhoven University of Technology, The Netherlands, 1988.
46. L.T. Wille, The football pool problem for 6 matches: a new upper bound obtained by simulated annealing, J. Combin. Theory Ser. A 45 (1987) 171-177.
47. L.T. Wille, New binary covering codes obtained by simulated annealing, IEEE Trans. Inform. Theory 42 (1996) 300-302.