Constructing Covering Codes with Given Automorphisms

Designs, Codes, and Cryptography

Volumn 16, Issue 1, 1999, Pages 65-73

  Östergård, Patric R J ^a,c   Weakley, William D ^b  

^a AALTO UNIVERSITY   (Finland)

^b PURDUE UNIVERSITY FORT WAYNE   (United States)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Automorphism group; Covering code; Dominating set; Hypercube; Tabu search

Indexed keywords

EID: 0347760659     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008326409439     Document Type: Article

References (18)

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. 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.
3. J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, and R. A. Wilson, Atlas of Finite Groups, Clarendon Press, Oxford (1985).
4. F. Glover, Tabu search - Part I, ORSA J. Comput., Vol. 1 (1989) pp. 190-206.
5. M. Hall, Jr., Combinatorial Theory, Blaisdell, Waltham, MA (1967).
6. I. S. Honkala and P. R. J. Östergård, Code design, Local Search in Combinatorial Optimization (E. Aarts and J. K. Lenstra, eds.), Wiley, New York (1997) pp. 441-456.
7. 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.
8. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977).
9. 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.
10. P. R. J. Östergård, A combinatorial proof for the football pool problem for six matches, J. Combin. Theory Ser. A, Vol. 76 (1996) pp. 160-163.
11. P. R. J. Östergård, Constructing covering codes by tabu search, J. Combin. Des., Vol. 5 (1997) pp. 71-80.
12. P. R. J. Östergård, New constructions for q-ary covering codes, Ars Combin., to appear.
13. P. R. J. Östergård and H. O. Hämäläinen, A new table of binary/ternary mixed covering codes, Des. Codes Cryptogr., Vol. 11 (1997) pp. 151-178.
14. P. R. J. Östergård and M. K. Kaikkonen, New upper bounds for binary covering codes, Discrete Math., Vol. 178 (1998) pp. 165-179.
15. R. G. Stanton and J. G. Kalbfleisch, Covering problems for dichotomized matchings, Aequationes Math., Vol. 1 (1968) pp. 94-103.
16. W. D. Weakley, Minimal dominating sets in hypercubes, Proceedings of the Eighth International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, to appear.
17. P. M. Weichsel, Dominating sets in n-cubes, J. Graph Theory, Vol. 18 (1994) pp. 479-488.
18. 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.