{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T05:24:28Z","timestamp":1710393868506},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1007\/bf01388476","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T09:27:06Z","timestamp":1112434026000},"page":"219-227","source":"Crossref","is-referenced-by-count":7,"title":["Two new bounds on the size of binary codes with a minimum distance of three"],"prefix":"10.1007","volume":"6","author":[{"given":"Yaron","family":"Klein","sequence":"first","affiliation":[]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Vardy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"189","volume":"4","author":"J. L. Allston","year":"1988","unstructured":"J. L. Allston, R. W. Buskens, and R. G. Stanton, An examination of the nonisomorphic solutions to a problem in covering designs in fifteen points.Math. Comp., Vol. 4 (1988) pp. 189?206.","journal-title":"Math. Comp."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/TIT.1980.1056269","volume":"26","author":"M. R. Best","year":"1980","unstructured":"M. R. Best, Binary codes with a minimum distance of four,IEEE Trans. Inform. Theory, Vol. IT-26 (1980) pp. 738?742.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TIT.1978.1055827","volume":"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, Bounds for binary codes of length less than 25,IEEE Trans. Inform. Theory, Vol. IT-24 (1978) pp. 81?93.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"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, Springer-Verlag, New York (1988)."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"J. H. Conway and N. J. A. Sloane, Quaternary constructions for the binary codes of Julin, Best, and others,Designs, Codes, and Cryptography, to appear.","DOI":"10.1007\/BF01388558"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TIT.1965.1053779","volume":"11","author":"D. Julin","year":"1965","unstructured":"D. Julin, Two improved block codes.IEEE Trans. Inform. Theory, Vol. IT-11 (1965) p. 459.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR7","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, Addison-Wesley, Reading, MA (1973)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"S. Litsyn and A. Vardy, The uniqueness of the Best code,IEEE Trans. Inform. Theory. to appear.","DOI":"10.1109\/18.333896"},{"key":"CR9","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, North-Holland, New York (1977)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/TIT.1959.1057514","volume":"5","author":"N. Wax","year":"1959","unstructured":"N. Wax, On upper bounds for error-detecting and error-correcting codes of finite length.IEEE Trans. Inform. Theory, Vol. IT-5 (1959) pp. 168?174.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388476\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388476.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388476\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388476","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T16:14:19Z","timestamp":1556813659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01388476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["BF01388476"],"URL":"https:\/\/doi.org\/10.1007\/bf01388476","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}