{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:39Z","timestamp":1725663519270},"publisher-location":"Berlin, Heidelberg","reference-count":5,"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_73","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:41:21Z","timestamp":1330184481000},"page":"377-385","source":"Crossref","is-referenced-by-count":2,"title":["Covering radius: Improving on the sphere-covering bound"],"prefix":"10.1007","author":[{"given":"Juriaan","family":"Simonis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"31_CR1","unstructured":"R.A. Brualdi, V.S. Pless and R.M. Wilson, \"Short Codes with a Given Covering Radius\", to appear in IEEE Trans. Inform. Theory."},{"key":"31_CR2","unstructured":"A.R. Calderbank and N.J.A. Sloane, \"Inequalities for Covering Codes\", to appear in IEEE Trans. Inform. Theory."},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","volume":"IT-31","author":"G.D. Cohen","year":"1985","unstructured":"G.D. Cohen, M.G. Karpovsky, H.F. Mattson, Jr. and J.R. Schatz, \"Covering Radius \u2014 Survey and Recent Results\", IEEE Trans. Inform. Theory, vol. IT-31, pp. 328\u2013343, 1985.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"31_CR4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"IT-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. IT-31, pp. 385\u2013401, 1985.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"31_CR5","unstructured":"J. Simonis, \"The Minimal Covering Radius t[15,6] of a 6-Dimensional Binary Linear Code of Length 15 is Equal to 4\", to appear in IEEE Trans. Inform. 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_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:50Z","timestamp":1619557250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51083-4_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510833","9783540461524"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-51083-4_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}