{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:34Z","timestamp":1772283514555,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994,1]]},"DOI":"10.1007\/bf01388558","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T08:33:07Z","timestamp":1112430787000},"page":"31-42","source":"Crossref","is-referenced-by-count":16,"title":["Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others"],"prefix":"10.1007","volume":"4","author":[{"given":"J. H.","family":"Conway","sequence":"first","affiliation":[]},{"given":"N. J. A.","family":"Sloane","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Binary codes with minimum distance four","author":"M.R. Best","year":"1978","unstructured":"Best, M.R. 1978. Binary codes with minimum distance four. Report ZW 112\/78, Math Centrum, Amsterdam."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/TIT.1980.1056269","volume":"26","author":"M.R. Best","year":"1980","unstructured":"Best, M.R. 1980. Binary codes with a minimum distance of four.IEEE Trans. Inform. Theory. 26:738?742.","journal-title":"IEEE Trans. Inform. Theory."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1109\/18.59932","volume":"36","author":"A.E. Brouwer","year":"1990","unstructured":"Brouwer, A.E., Shearer, J.B., Sloane, N.J.A. and Smith, W.D. 1990. A new table of constant weight codes.IEEE Trans. Inform. Theory. 36:1334?1380.","journal-title":"IEEE Trans. Inform. Theory."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1090\/S0273-0979-1993-00426-9","volume":"29","author":"A.R. Calderbank","year":"1993","unstructured":"Calderbank, A.R., Hammons Jr., A.R., Kumar, P.V., Sloane, N.J.A. and Sol\u00e9, P. 1993. A linear construction for certain Kerdock and Preparata codes,Bull. Amer. Math. Soc. 29:218?222.","journal-title":"Bull. Amer. Math. Soc."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1109\/TIT.1987.1057291","volume":"33","author":"A.R. Calderbank","year":"1987","unstructured":"Calderbank, A.R. and Sloane, N.J.A. 1987. New trellis codes based on lattices and cosets.IEEE Trans. Inform. Theory. 33:177?195.","journal-title":"IEEE Trans. Inform. Theory."},{"key":"CR6","unstructured":"Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A., and Wilson, R.A. 1985.ATLAS of Finite Groups, Oxford Univ. Press."},{"key":"CR7","volume-title":"Sphere-Packings, Lattices and Groups","author":"J.H. Conway","year":"1992","unstructured":"Conway, J.H. and Sloane, N.J.A. 1992.Sphere-Packings, Lattices and Groups, 2nd ed., NY: Springer-Verlag,","edition":"2nd ed."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Forney Jr., G.D., Sloane, N.J.A., and Trott, M.D. 1994. The Nordstrom-Robinson code is the binary image of the octacode.Proceedings DIMACS\/IEEE Workshop on Coding and Quantization. To appear.","DOI":"10.1090\/dimacs\/014\/03"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/18.9787","volume":"34","author":"H. H\u00e4m\u00e4l\u00e4inen","year":"1988","unstructured":"H\u00e4m\u00e4l\u00e4inen, H. 1988. Two new binary codes with minimum distance three.IEEE Trans. Inform. Theory. 34:875.","journal-title":"IEEE Trans. Inform. Theory."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Hammons, R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., and Sol\u00e9, P. 1994. The ?4-linearity of Kerdock, Preparata, Goethals and Related Codes,IEEE Trans. Inform. Theory volume 40. To appear.","DOI":"10.1109\/18.312154"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TIT.1965.1053779","volume":"11","author":"D. Julin","year":"1965","unstructured":"Julin, D. 1965. Two improved block codes.IEEE Trans. Inform. Theory. 11:459.","journal-title":"IEEE Trans. Inform. Theory."},{"key":"CR12","unstructured":"Litsyn, S.N. and Vardy, A. 1993. The Uniqueness of the Best Code, preprint."},{"key":"CR13","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, Amsterdam: North-Holland."},{"key":"CR14","unstructured":"Norton, S.P. Personal communication."},{"key":"CR15","first-page":"101","volume":"19","author":"A.M. Romanov","year":"1983","unstructured":"Romanov, A.M. 1983. New binary codes of minimal distance 3 (in Russian).Problemy Peredachi Informatsii. 19:101?102.","journal-title":"Problemy Peredachi Informatsii."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1109\/TIT.1970.1054540","volume":"16","author":"N.J.A. Sloane","year":"1970","unstructured":"Sloane, N.J.A. and Whitehead, D.S. 1970. A new family of single-error correcting codes.IEEE Trans. Inform. Theory. 16:717?719.","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\/BF01388558\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388558.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388558\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T16:32:26Z","timestamp":1586190746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01388558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF01388558"],"URL":"https:\/\/doi.org\/10.1007\/bf01388558","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}