{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:25Z","timestamp":1725663865616},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578437"},{"type":"electronic","value":"9783540483571"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57843-9_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:29:04Z","timestamp":1330262944000},"page":"253-262","source":"Crossref","is-referenced-by-count":0,"title":["Two new upper bounds for codes of distance 3"],"prefix":"10.1007","author":[{"given":"Simon","family":"Litsyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Vardy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/TIT.1980.1056269","volume":"IT-26","author":"M. R. Best","year":"1980","unstructured":"M.R. Best, \u201cBinary codes with a minimum distance of four,\u201d IEEE Trans. Inform. Theory, vol. IT-26, pp. 738\u2013742, 1980.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TIT.1978.1055827","volume":"IT-24","author":"M. R. Best","year":"1978","unstructured":"M.R. Best, A.E. Brouwer, F.J. MacWilliams, A.M. Odlyzko, and N.J.A. Sloane, \u201cBounds for binary codes of length less than 25,\u201d IEEE Trans. Inform. Theory, vol. IT-24, pp. 81\u201393, 1978.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/TIT.1977.1055665","volume":"IT-23","author":"J.-M. Goethals","year":"1977","unstructured":"J.-M. Goethals, \u201cThe extended Nadler code is unique,\u201d IEEE Trans. Inform. Theory, vol. IT-23, pp. 132\u2013135, 1977.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"26_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"Sphere Packings, Lattices and Groups","author":"J. H. Conway","year":"1988","unstructured":"J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups, New York: Springer-Veralg, 1988."},{"key":"26_CR5","unstructured":"J.H. Conway and N.J.A. Sloane, \u201cQuaternary constructions for the binary codes of Julin, Best, and others,\u201d preprint."},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(75)90047-3","volume":"12","author":"P. Delsarte","year":"1975","unstructured":"P. Delsarte and J.-M. Goethals, \u201cUnrestricted codes with the Golay parameters are unique,\u201d Discr. Math., vol. 12, pp. 211\u2013224, 1975.","journal-title":"Discr. Math."},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TIT.1965.1053779","volume":"IT-11","author":"D. Julin","year":"1965","unstructured":"D. Julin, \u201cTwo improved block codes,\u201d JEEE Trans. Inform. Theory, vol. IT-11, p. 459, 1965.","journal-title":"JEEE Trans. Inform. Theory"},{"key":"26_CR8","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D.E. Knuth, The Art of Computer Programming: Sorting and Searching, Reading: Addison-Wesley, 1973."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"S. Litsyn and A. Vardy, \u201cThe uniqueness of the Best code,\u201d submitted to JEEE Trans. Inform. Theory.","DOI":"10.1109\/18.333896"},{"key":"26_CR10","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, New York: North-Holland, 1977."},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0021-9800(68)80067-5","volume":"5","author":"V. Pless","year":"1968","unstructured":"V. Pless, \u201cOn the uniqueness of the Golay codes,\u201d J. Comb. Theory, vol. 5, pp. 215\u2013228, 1968.","journal-title":"J. Comb. Theory"},{"key":"26_CR12","unstructured":"S. Snover, \u201cThe uniqueness of the Nordstrom-Robinson and the Golay binary codes,\u201d Ph.D. Thesis, Michigan State University, 1973."},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/TIT.1959.1057514","volume":"IT-5","author":"N. Wax","year":"1959","unstructured":"N. Wax, \u201cOn upper bounds for error-detecting and error-correcting codes of finite length,\u201d IEEE Trans. Inform. Theory, vol. IT-5, pp. 168\u2013174, 1959.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Algebraic Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57843-9_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:44Z","timestamp":1619572124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57843-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578437","9783540483571"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57843-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}