{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:01:34Z","timestamp":1761292894454},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540510833"},{"type":"electronic","value":"9783540461524"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51083-4_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:40:44Z","timestamp":1330184444000},"page":"7-21","source":"Crossref","is-referenced-by-count":7,"title":["Recent results on covering problems"],"prefix":"10.1007","author":[{"given":"J. H.","family":"Lint","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"2_CR1","first-page":"193","volume":"40","author":"E.H.L. Aarts","year":"1985","unstructured":"E.H.L. AARTS AND P.J.M. VAN LAARHOVEN, Statistical Cooling: A General Approach to Combinatorial Optimization Problems, Philips J. of Research, 40 (1985), pp. 193\u2013226.","journal-title":"Philips J. of Research"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1109\/TIT.1986.1057229","volume":"32","author":"M.J. Adams","year":"1986","unstructured":"M.J. ADAMS, Subcodes and covering radius, IEEE Trans. Information Theory, IT 32 (1986), pp. 700\u2013701.","journal-title":"IEEE Trans. Information Theory"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0097-3165(84)90010-4","volume":"A35","author":"A. Blokhuis","year":"1984","unstructured":"A. BLOKHUIS AND C.W.H. LAM, Coverings by Rook Domains, J. Combinatorial Theory, A35 (1984), pp. 240\u2013244.","journal-title":"J. Combinatorial Theory"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"R.A. BRUALDI, V.S. PLESS AND R.M. WILSON, Short Codes with a Given Covering Radius, IEEE Trans. Information Theory (to appear).","DOI":"10.1109\/18.42181"},{"key":"2_CR5","unstructured":"R.A. BRUALDI AND V.S. PLESS, On the covering radius of a code and its subcodes, preprint."},{"key":"2_CR6","unstructured":"On the length of codes with a given covering radius, preprint."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1109\/TIT.1985.1057073","volume":"31","author":"P.B. Busschbach","year":"1985","unstructured":"P.B. BUSSCHBACH, M.G.L. GERRETZEN AND H.C.A. VAN TILBORG, On the Covering Radius of Binary, Linear Codes Meeting the Griesmer Bound, IEEE Trans. Information Theory, IT 31 (1985), pp. 465\u2013468.","journal-title":"IEEE Trans. Information Theory"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"A.R. CALDERBANK, Covering Radius and the Chromatic Number of Kneser Graphs, J. Combinatorial Theory (to appear).","DOI":"10.1016\/0097-3165(90)90011-K"},{"key":"2_CR9","unstructured":"A.R. CALDERBANK AND N.J. SLOANE, Inequalities for covering codes, preprint."},{"key":"2_CR10","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-Survey and Recent Results, IEEE Trans. Information Theory, IT 31 (1985), pp. 328\u2013343.","journal-title":"IEEE Trans. Information Theory"},{"key":"2_CR11","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. Information Theory, IT 32 (1986), pp. 680\u2013694.","journal-title":"IEEE Trans. Information Theory"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/TIT.1985.1057033","volume":"31","author":"D.E. Downey","year":"1985","unstructured":"D.E. DOWNEY AND N.J.A. SLOANE, The covering radius of cyclic codes of length up to 31, IEEE Trans. Information Theory, IT 31 (1985), pp. 446\u2013447.","journal-title":"IEEE Trans. Information Theory"},{"key":"2_CR13","first-page":"109","volume":"A35","author":"H. Fernandes","year":"1985","unstructured":"H. FERNANDES AND E. RECHTSCHAFFEN, The Football Pool Problem for 7 and 8 Matches, J. Combinatorial Theory, A35 (1985), pp. 109\u2013114.","journal-title":"J. Combinatorial Theory"},{"key":"2_CR14","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. Information Theory, IT 31 (1985), pp. 385\u2013401.","journal-title":"IEEE Trans. Information Theory"},{"key":"2_CR15","unstructured":"M.W. VAN DER HAM, Simulated Annealing applied in Coding Theory, Master's Thesis, Eindhoven University of Technology, (1988)."},{"key":"2_CR16","unstructured":"H.O. H\u00c4M\u00c4L\u00c4INEN, Upper bounds for football pool problems and mixed covering codes, preprint."},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/18.2644","volume":"34","author":"I.S. Honkala","year":"1988","unstructured":"I.S. HONKALA, Lower Bounds for Binary Covering Codes, IEEE Trans. Information Theory, IT 34 (1988), pp. 326\u2013329.","journal-title":"IEEE Trans. Information Theory"},{"key":"2_CR18","unstructured":"I.S. HONKALA AND H.O. H\u00c4M\u00c4L\u00c4INEN, A New Family of Covering Codes, IEEE Trans. Information Theory (to appear)."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"H. JANWA, Some New Upper Bounds on the Covering Radius of Codes, IEEE Trans. Information Theory (to appear).","DOI":"10.1109\/18.42182"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-16776-5_714","volume":"229","author":"H. Janwa","year":"1986","unstructured":"H. JANWA AND H.F. MATTSON, JR., Covering Radii of Even Subcodes of t-dense Codes, Proc. AAECC 3, Grenoble, Lect. Notes Comput. Sci. 229 (1986), pp. 120\u2013130.","journal-title":"Lect. Notes Comput. Sci."},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0021-9800(67)80102-9","volume":"A3","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. Combinatorial Theory, A3 (1967), pp. 315\u2013325.","journal-title":"J. Combinatorial Theory"},{"key":"2_CR22","first-page":"679","volume":"4","author":"H.J.L. Kamps","year":"1970","unstructured":"\u2014, A covering problem, Colloquia Mathematica Societatis J\u00e1nos Bolyai, 4 (1970), pp. 679\u2013685.","journal-title":"Colloquia Mathematica Societatis J\u00e1nos Bolyai"},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1137\/0608049","volume":"8","author":"K.E. Kilby","year":"1987","unstructured":"K.E. KILBY AND N.J.A. SLOANE, On the Covering Radius Problem for Codes I, II, SIAM J. Algebraic and Discrete Methods, 8 (1987), pp. 604\u2013627.","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"2_CR24","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. KIRKPATRICK, C.D. GELATT, JR. AND M.P. VECHI, Optimization by Simulated Annealing, Science 220 (1983), pp. 671\u2013680.","journal-title":"Science"},{"key":"2_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"P.J.M. Laarhoven Van","year":"1987","unstructured":"P.J.M. VAN LAARHOVEN AND E.H.L. AARTS, Simulated Annealing: Theory and Applications, D. Reidel Publishing Company, Kluwer Academic Publishers, Dordrecht, The Netherlands, (1987)."},{"key":"2_CR26","doi-asserted-by":"crossref","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. Combinatorial Theory (to appear).","DOI":"10.1016\/0097-3165(89)90036-8"},{"key":"2_CR27","unstructured":"J.H. VAN LINT, JR, Covering Radius Problems, Master's Thesis, Eindhoven University of Technology, (1988)."},{"key":"2_CR28","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-16767-6_53","volume":"228","author":"H.F. Mattson Jr.","year":"1986","unstructured":"H.F. MATTSON, JR., An Improved Upper Bound on Covering Radius, Lecture Notes in Computer Science, 228 (1986), pp. 90\u2013106.","journal-title":"Lecture Notes in Computer Science"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"N. METROPOLIS, A. ROSENBLUTH, M. ROSENBLUTH, A. TELLER AND E. TELLER, Equation of State Calculations by Fast Computer Machines, J. of Chem. Physics, 21 (19853), pp. 1087\u20131092.","DOI":"10.1063\/1.1699114"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"J. PACH AND J. SPENCER, Explicit codes with low covering radius, IEEE Trans. Information Theory (to appear).","DOI":"10.1109\/18.21258"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"J. SIMONIS, The minimal covering radius t[15, 6] of a 6-dimensional binary linear code of length 15 is equal to 4, IEEE Trans. Information Theory (to appear).","DOI":"10.1109\/18.21266"},{"key":"2_CR32","unstructured":"A.N. SKOROBOGATOV, On the covering radius of BCH codes, Proc. Third Int. Workshop on Information Theory, Sochi (1987), pp. 308\u2013309."},{"key":"2_CR33","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0097-3165(86)90007-5","volume":"A24","author":"N.J.A. Sloane","year":"1986","unstructured":"N.J.A. SLOANE, A new approach to the covering radius of codes, J. Combinatorial Theory, A24 (1986), pp. 61\u201386.","journal-title":"J. Combinatorial Theory"},{"key":"2_CR34","first-page":"13","volume":"41","author":"E. Velikova","year":"1988","unstructured":"E. VELIKOVA, Bounds on covering radius of linear codes, Comptes Rendus de l'Academie bulgare des Sciences, 41 (1988), pp. 13\u201316.","journal-title":"Comptes Rendus de l'Academie bulgare des Sciences"},{"key":"2_CR35","first-page":"109","volume":"A35","author":"E.W. Weber","year":"1983","unstructured":"E.W. WEBER, On the Football Pool Problem for 6 Matches: A New Upper Bound, J. Combinatorial Theory, A35 (1983), pp. 109\u2013114.","journal-title":"J. Combinatorial Theory"},{"key":"2_CR36","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/18.2632","volume":"34","author":"G.J.M. Wee Van","year":"1988","unstructured":"G.J.M. VAN WEE, Improved Sphere Bounds on the Covering Radius of Codes, IEEE Trans. Information Theory, IT 34 (1988), pp. 237\u2013245.","journal-title":"IEEE Trans. Information Theory"},{"key":"2_CR37","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0097-3165(87)90012-4","volume":"A45","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. Combinatorial Theory, A45 (1987), pp. 171\u2013177.","journal-title":"J. Combinatorial Theory"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51083-4_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:19:41Z","timestamp":1605629981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51083-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510833","9783540461524"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-51083-4_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}