{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:40Z","timestamp":1759063780463,"version":"3.41.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1023\/a:1008326409439","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"65-73","source":"Crossref","is-referenced-by-count":6,"title":["Constructing Covering Codes with Given Automorphisms"],"prefix":"10.1007","volume":"16","author":[{"given":"Patric R. J.","family":"Osterg","sequence":"first","affiliation":[]},{"given":"William D.","family":"Weakley","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"189031_CR1","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0097-3165(84)90010-4","volume":"36","author":"A. Blokhuis","year":"1984","unstructured":"A. Blokhuis and C. W. H. Lam, More coverings by rook domains, J. Combin. Theory Ser. A, Vol. 36 (1984) pp. 240-244.","journal-title":"J. Combin. Theory Ser. A"},{"key":"189031_CR2","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TIT.1986.1057227","volume":"32","author":"G. D. Cohen","year":"1986","unstructured":"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.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"189031_CR3","volume-title":"Atlas of Finite Groups","author":"J. H. Conway","year":"1985","unstructured":"J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, and R. A. Wilson, Atlas of Finite Groups, Clarendon Press, Oxford (1985)."},{"key":"189031_CR4","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu search\u2014Part I, ORSA J. Comput., Vol. 1 (1989) pp. 190-206.","journal-title":"ORSA J. Comput."},{"key":"189031_CR5","volume-title":"Combinatorial Theory","author":"M. Hall Jr.","year":"1967","unstructured":"M. Hall, Jr., Combinatorial Theory, Blaisdell, Waltham, MA (1967)."},{"key":"189031_CR6","first-page":"441","volume-title":"Local Search in Combinatorial Optimization","author":"I. S. Honkala","year":"1997","unstructured":"I. S. Honkala and P. R. J. \u00d6sterg\u00e5rd, Code design, Local Search in Combinatorial Optimization (E. Aarts and J. K. Lenstra, eds.), Wiley, New York (1997) pp. 441-456."},{"key":"189031_CR7","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0097-3165(89)90036-8","volume":"52","author":"P. J. M. van Laarhoven","year":"1989","unstructured":"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.","journal-title":"J. Combin. Theory Ser. A"},{"key":"189031_CR8","volume-title":"The Theory of Error-Correcting Codes","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977)."},{"key":"189031_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0097-3165(94)90010-8","volume":"67","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1994","unstructured":"P. R. J. \u00d6sterg\u00e5rd, New upper bounds for the football pool problem for 11 and 12 matches, J. Combin. Theory Ser. A, Vol. 67 (1994) pp. 161-168.","journal-title":"J. Combin. Theory Ser. A"},{"key":"189031_CR10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1006\/jcta.1996.0097","volume":"76","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1996","unstructured":"P. R. J. \u00d6sterg\u00e5rd, A combinatorial proof for the football pool problem for six matches, J. Combin. Theory Ser. A, Vol. 76 (1996) pp. 160-163.","journal-title":"J. Combin. Theory Ser. A"},{"key":"189031_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/(SICI)1520-6610(1997)5:1<71::AID-JCD6>3.0.CO;2-V","volume":"5","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1997","unstructured":"P. R. J. \u00d6sterg\u00e5rd, Constructing covering codes by tabu search, J. Combin. Des., Vol. 5 (1997) pp. 71-80.","journal-title":"J. Combin. Des."},{"key":"189031_CR12","unstructured":"P. R. J. \u00d6sterg\u00e5rd, New constructions for q-ary covering codes, Ars Combin., to appear."},{"key":"189031_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008228721072","volume":"11","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1997","unstructured":"P. R. J. \u00d6sterg\u00e5rd and H. O. H\u00e4m\u00e4l\u00e4inen, A new table of binary\/ternary mixed covering codes, Des. Codes Cryptogr., Vol. 11 (1997) pp. 151-178.","journal-title":"Des. Codes Cryptogr."},{"key":"189031_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0012-365X(97)81825-0","volume":"178","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1998","unstructured":"P. R. J. \u00d6sterg\u00e5rd and M. K. Kaikkonen, New upper bounds for binary covering codes, Discrete Math., Vol. 178 (1998) pp. 165-179.","journal-title":"Discrete Math."},{"key":"189031_CR15","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01817562","volume":"1","author":"R. G. Stanton","year":"1968","unstructured":"R. G. Stanton and J. G. Kalbfleisch, Covering problems for dichotomized matchings, Aequationes Math., Vol. 1 (1968) pp. 94-103.","journal-title":"Aequationes Math."},{"key":"189031_CR16","unstructured":"W. D. Weakley, Minimal dominating sets in hypercubes, Proceedings of the Eighth International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, to appear."},{"key":"189031_CR17","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/jgt.3190180506","volume":"18","author":"P. M. Weichsel","year":"1994","unstructured":"P. M. Weichsel, Dominating sets in n-cubes, J. Graph Theory, Vol. 18 (1994) pp. 479-488.","journal-title":"J. Graph Theory"},{"key":"189031_CR18","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0097-3165(87)90012-4","volume":"45","author":"L. T. Wille","year":"1987","unstructured":"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.","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008326409439.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008326409439\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008326409439.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:40:44Z","timestamp":1753760444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008326409439"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["189031"],"URL":"https:\/\/doi.org\/10.1023\/a:1008326409439","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}