{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:36:44Z","timestamp":1773232604621,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":[[1993,5]]},"DOI":"10.1007\/bf01388407","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T08:31:01Z","timestamp":1112430661000},"page":"95-98","source":"Crossref","is-referenced-by-count":24,"title":["A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters"],"prefix":"10.1007","volume":"3","author":[{"given":"A. E.","family":"Brouwer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. M. G. M.","family":"Tolhuizen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Brouwer, A.E. 1992.The linear programming bound for binary linear codes. PreprintIEEE Trans. Inf. Th., submitted."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Brouwer, A.E. and Verhoeff, T.An updated table of minimum-distance bounds for binary linear codes, preprint (March 1992). (IEEE Trans. Inf. Th., to appear)","DOI":"10.1109\/18.212301"},{"key":"CR3","unstructured":"Dodunekov, S.M. and Zinoviev, V.A. 1984.A note on Preparata codes. InProc. of the 6th Intern. Symp. Inform. Th., Tashkent 1984, 1984."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(72)90025-8","volume":"3","author":"J.-M. Goethals","year":"1972","unstructured":"Goethals, J.-M. and Snover, S.L., 1972.Nearly perfect binary codes.Discrete Math. 3:65?88.","journal-title":"Discrete Math."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Johnson, S.M. 1962.A new upper bound for error correcting codes, IRE Trans. Inform. Th. IT-8:203?207.","DOI":"10.1109\/TIT.1962.1057714"},{"key":"CR6","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J. and Sloane, N.J.A. 1977.The Theory of Error-Correcting Codes, North Holland Publ. Co., Amsterdam."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/S0019-9958(68)90874-7","volume":"13","author":"F.P. Preparata","year":"1968","unstructured":"Preparata, F.P. 1968.A class of optimum nonlinear double-error correcting codes.Inf. & Control 13: 378?400.","journal-title":"Inf. & Control"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/TIT.1959.1057514","volume":"5","author":"N. Wax","year":"1959","unstructured":"Wax, N. 1959.On upper bounds for error detecting and error correcting codes of finite length.IEEE Trans. Info. Theory 5:168?174.","journal-title":"IEEE Trans. Info. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388407\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388407.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388407\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T16:32:19Z","timestamp":1586190739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01388407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["BF01388407"],"URL":"https:\/\/doi.org\/10.1007\/bf01388407","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}