{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:29:17Z","timestamp":1694629757887},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s10623-006-9015-8","type":"journal-article","created":{"date-parts":[[2006,10,31]],"date-time":"2006-10-31T21:22:19Z","timestamp":1162329739000},"page":"67-72","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved lower bounds on sizes of single-error correcting codes"],"prefix":"10.1007","volume":"42","author":[{"given":"Simon","family":"Litsyn","sequence":"first","affiliation":[]},{"given":"Beniamin","family":"Mounits","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,1]]},"reference":[{"issue":"4","key":"9015_CR1","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1109\/18.9787","volume":"34","author":"HO H\u00e4m\u00e4l\u00e4inen","year":"1988","unstructured":"H\u00e4m\u00e4l\u00e4inen HO (1988) Two new binary codes with minimum distance three. IEEE Trans Inform Theory 34(4):875","journal-title":"IEEE Trans Inform Theory"},{"issue":"4","key":"9015_CR2","first-page":"3","volume":"24","author":"GA Kabatyanskii","year":"1988","unstructured":"Kabatyanskii GA, Panchenko VI (1988) Packings and coverings of the Hamming space by sphers of radius one. Problems Inform Trans 24(4):3\u201316","journal-title":"Problems Inform Trans"},{"key":"9015_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0097-3165(71)90051-3","volume":"11","author":"JG Kalbfleisch","year":"1971","unstructured":"Kalbfleisch JG, Stanton RG, Horton JD (1971) On covering sets and error-correcting codes. J Comb Theory 11:233\u2013250","journal-title":"J Comb Theory"},{"key":"9015_CR4","first-page":"463","volume-title":"Handbook of Coding Theory vol. 1","author":"S Litsyn","year":"1998","unstructured":"Litsyn S (1998) An updated table of the best binary codes known. In: Pless VS, Huffman WC (eds) Handbook of Coding Theory vol. 1. Elsevier, Amsterdam, pp 463\u2013498"},{"key":"9015_CR5","volume-title":"The theory of error-correcting codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams FJ, Sloane NJA (1977) The theory of error-correcting codes. North-Holland, Amsterdam"},{"issue":"4","key":"9015_CR6","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/18.508854","volume":"42","author":"PRJ \u00d6sterg\u00e5rd","year":"1996","unstructured":"\u00d6sterg\u00e5rd PRJ, Kaikkonen MK (1996) New single-error-correcting codes. IEEE Trans Inform Theory 42(4):pp 1261\u20131262","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.1007\/s10623-006-9015-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-006-9015-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9015-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9015-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T01:09:35Z","timestamp":1652576975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-006-9015-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["9015"],"URL":"https:\/\/doi.org\/10.1007\/s10623-006-9015-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,1]]},"assertion":[{"value":"16 January 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}