{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:02:01Z","timestamp":1772283721201,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":[[1997,5]]},"DOI":"10.1023\/a:1008228721072","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"151-178","source":"Crossref","is-referenced-by-count":12,"title":["A New Table of Binary\/Ternary Mixed Covering Codes"],"prefix":"10.1007","volume":"11","author":[{"given":"Patric R. J.","family":"\u00d6sterg\u00e5rd","sequence":"first","affiliation":[]},{"given":"Heikki O.","family":"H\u00e4m\u00e4l\u00e4inen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"129335_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\u2013244.","journal-title":"J. Combin. Theory Ser. A"},{"key":"129335_CR2","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1109\/18.59932","volume":"36","author":"A. E. Brouwer","year":"1990","unstructured":"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\u20131380.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(85)90152-9","volume":"57","author":"W. A. Carnielli","year":"1985","unstructured":"W. A. Carnielli, On covering and coloring problems for rook domains, Discrete Math., Vol. 57 (1985) pp. 9\u201316.","journal-title":"Discrete Math."},{"key":"129335_CR4","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1109\/18.54887","volume":"36","author":"W. Chen","year":"1990","unstructured":"W. Chen and I. S. Honkala, Lower bounds for q-ary covering codes, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 664\u2013671.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR5","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","volume":"31","author":"G. D. Cohen","year":"1985","unstructured":"G. D. Cohen, M. G. Karpovsky, H. F. Mattson, Jr., and J. R. Schatz, Covering radius\u2014survey and recent results, IEEE Trans. Inform. Theory, Vol. 31 (1985) pp. 328\u2013343.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR6","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\u2013694.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR7","unstructured":"R. Davies and G. F. Royle, Graph domination, tabu search and the football pool problem, Discrete Appl. Math, to appear."},{"key":"129335_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/18.179360","volume":"39","author":"T. Etzion","year":"1993","unstructured":"T. Etzion and G. Greenberg, Constructions for perfect mixed codes and other covering codes, IEEE Trans. Inform. Theory, Vol. 39 (1993) pp. 209\u2013214.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR9","unstructured":"G. Exoo, personal communication."},{"key":"129335_CR10","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/TIT.1964.1053680","volume":"10","author":"S. W. Golomb","year":"1964","unstructured":"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\u2013208.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR11","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"31","author":"R. L. Graham","year":"1985","unstructured":"R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory, Vol. 31 (1985) pp. 385\u2013401.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01388486","volume":"3","author":"H. O. H\u00e4m\u00e4l\u00e4inen","year":"1993","unstructured":"H. O. H\u00e4m\u00e4l\u00e4inen, I. S. Honkala, M. K. Kaikkonen, and S. N. Litsyn, Bounds for binary multiple covering codes, Des. Codes Cryptogr., Vol. 3 (1993) pp. 251\u2013275.","journal-title":"Des. Codes Cryptogr."},{"key":"129335_CR13","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0097-3165(91)90024-B","volume":"56","author":"H. H\u00e4m\u00e4l\u00e4inen","year":"1991","unstructured":"H. H\u00e4m\u00e4l\u00e4inen and S. Rankinen, Upper bounds for football pool problems and mixed covering codes, J. Combin. Theory Ser. A, Vol. 56 (1991) pp. 84\u201395.","journal-title":"J. Combin. Theory Ser. A"},{"key":"129335_CR14","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/S0019-9958(71)90464-5","volume":"18","author":"M. Herzog","year":"1971","unstructured":"M. Herzog and J. Sch\u00f6nheim, Linear and nonlinear single-error-correcting perfect mixed codes, Inform. and Control, Vol. 18 (1971) pp. 364\u2013368.","journal-title":"Inform. and Control"},{"key":"129335_CR15","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/18.86975","volume":"37","author":"I. S. Honkala","year":"1991","unstructured":"I. S. Honkala, On (k, t)-subnormal covering codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 1203\u20131206.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0166-218X(94)90141-4","volume":"52","author":"I. S. Honkala","year":"1994","unstructured":"I. S. Honkala, On (q, 1)-subnormal q-ary covering codes, Discrete Appl. Math., Vol. 52 (1994) pp. 213\u2013221.","journal-title":"Discrete Appl. Math."},{"key":"129335_CR17","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1109\/18.21265","volume":"34","author":"I. S. Honkala","year":"1988","unstructured":"I. S. Honkala and H. O. H\u00e4m\u00e4l\u00e4inen, A new construction for covering codes, IEEE Trans. Inform. Theory, Vol. 34 (1988) pp. 1343\u20131344.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR18","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1112\/jlms\/s1-44.1.60","volume":"44","author":"J. G. Kalbfleisch","year":"1969","unstructured":"J. G. Kalbfleisch and R. G. Stanton, A combinatorial theorem in matching, J. London Math. Soc. (1), Vol. 44 (1969) pp. 60\u201364; and (2), Vol. 1 (1969) p. 398.","journal-title":"J. London Math. Soc. (1)"},{"key":"129335_CR19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0021-9800(67)80102-9","volume":"3","author":"H. J. L. Kamps","year":"1967","unstructured":"H. J. L. Kamps and J. H. van Lint, The football pool problem for 5 matches, J. Combin. Theory, Vol. 3 (1967) pp. 315\u2013325.","journal-title":"J. Combin. Theory"},{"key":"129335_CR20","first-page":"679","volume":"4","author":"H. J. L. Kamps","year":"1970","unstructured":"H. J. L. Kamps and J. H. van Lint, A covering problem, Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 4 (1970) pp. 679\u2013685.","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"129335_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/3-540-57843-9_6","volume-title":"On some mixed covering codes of small length, Algebraic Coding","author":"E. Kolev","year":"1994","unstructured":"E. Kolev and I. Landgev, On some mixed covering codes of small length, Algebraic Coding (G. Cohen, S. Litsyn, A. Lobstein, and G. Z\u00e9mor, eds.), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 781 (1994) pp. 38\u201350."},{"key":"129335_CR22","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\u2013312.","journal-title":"J. Combin. Theory Ser. A"},{"key":"129335_CR23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4153\/CMB-1975-011-2","volume":"18","author":"B. Lindstr\u00f6m","year":"1975","unstructured":"B. Lindstr\u00f6m, Group partitions and mixed perfect codes, Canad. Math. Bull., Vol. 18 (1975) pp. 57\u201360.","journal-title":"Canad. Math. Bull."},{"key":"129335_CR24","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0097-3165(91)90011-5","volume":"57","author":"J. H. van Lint Jr.","year":"1991","unstructured":"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\u2013143.","journal-title":"J. Combin. Theory Ser. A"},{"key":"129335_CR25","unstructured":"J. H. van Lint Jr., Covering Radius Problems, M.Sc. thesis, Eindhoven University of Technology (1988)."},{"key":"129335_CR26","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/18.61135","volume":"37","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1991","unstructured":"P. R. J. \u00d6sterg\u00e5rd, A new binary code of length 10 and covering radius 1, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 179\u2013180.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR27","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/18.79926","volume":"37","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1991","unstructured":"P. R. J. \u00d6sterg\u00e5rd, Upper bounds for q-ary covering codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 660\u2013664; and Vol. 37 (1991) p. 1738.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR28","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1109\/18.108275","volume":"38","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1992","unstructured":"P. R. J. \u00d6sterg\u00e5rd, Further results on (k, t)-subnormal covering codes, IEEE Trans. Inform. Theory, Vol. 38 (1992) pp. 206\u2013210.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129335_CR29","first-page":"387","volume-title":"Construction methods for mixed covering codes, Analysis, Algebra and Computers in Mathematical Research: Proceedings of the Twenty-first Nordic Congress of Mathematicians","author":"P. R. J. \u00d6sterg\u00e5rd","year":"1994","unstructured":"P. R. J. \u00d6sterg\u00e5rd, 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\u2013408."},{"key":"129335_CR30","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\u2013168.","journal-title":"J. Combin. Theory Ser. A"},{"key":"129335_CR31","unstructured":"P. R. J. \u00d6sterg\u00e5rd, The football pool problem, Congr. Numer., Vol. 114 (1996) pp. 33\u201343."},{"key":"129335_CR32","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\u201380.","journal-title":"J. Combin. Des."},{"key":"129335_CR33","unstructured":"P. R. J. \u00d6sterg\u00e5rd, A coloring problem in Hamming spaces, European J. Combin., to appear."},{"key":"129335_CR34","volume-title":"Packing and Covering","author":"C. A. Rogers","year":"1964","unstructured":"C. A. Rogers, Packing and Covering, Camb. Univ. Press, Cambridge (1964)."},{"key":"129335_CR35","volume-title":"Packing and Covering in Combinatorics","year":"1979","unstructured":"A. Schrijver (ed.), Packing and Covering in Combinatorics, M. C. Tracts 106, Amsterdam: Matematisch Centrum (1979)."},{"key":"129335_CR36","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0088898","volume-title":"A computer search for B-coverings, Combinatorial Mathematics VII","author":"R. G. Stanton","year":"1980","unstructured":"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\u201350."},{"key":"129335_CR37","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0012-365X(91)90143-P","volume":"87","author":"G. J. M. van Wee","year":"1991","unstructured":"G. J. M. van Wee, On the non-existence of certain perfect mixed codes, Discrete Math., Vol. 87 (1991) pp. 323\u2013326.","journal-title":"Discrete Math."},{"key":"129335_CR38","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\u2013177.","journal-title":"J. Combin. Theory Ser. A"},{"key":"129335_CR39","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1109\/18.481808","volume":"42","author":"L. T. Wille","year":"1996","unstructured":"L. T. Wille, New binary covering codes obtained by simulated annealing, IEEE Trans. Inform. Theory, Vol. 42 (1996) pp. 300\u2013302.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008228721072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008228721072\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008228721072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:31:03Z","timestamp":1753756263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008228721072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["129335"],"URL":"https:\/\/doi.org\/10.1023\/a:1008228721072","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}