{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:51:05Z","timestamp":1761058265863},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"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,9]]},"DOI":"10.1007\/bf01398007","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T14:56:49Z","timestamp":1112453809000},"page":"91-96","source":"Crossref","is-referenced-by-count":13,"title":["New extremal doubly-even [64, 32, 12] codes"],"prefix":"10.1007","volume":"6","author":[{"given":"Masaaki","family":"Harada","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Kimura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0012-365X(89)90286-0","volume":"76","author":"F. C. Bussemarker","year":"1989","unstructured":"F. C. Bussemarker and V.D. Tonchev, New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28,Discrete Math., Vol. 76 (1989) pp. 45?49.","journal-title":"Discrete Math."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(90)90208-Y","volume":"82","author":"F. C. Bussemarker","year":"1990","unstructured":"F. C. Bussemarker and V. D. Tonchev, Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20,Discrete Math., Vol. 82 (1990) pp. 317?321.","journal-title":"Discrete Math."},{"key":"CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511662140","volume-title":"Graphs, Codes and Designs","author":"P. J. Cameron","year":"1980","unstructured":"P. J. Cameron and J. H. van Lint,Graphs, Codes and Designs, Cambridge University Press, Cambridge (1980)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(90)90012-7","volume":"83","author":"S. N. Kapralov","year":"1990","unstructured":"S. N. Kapralov and V. D. Tonchev, Extremal doubly-even codes of length 64 derived from symmetric designs,Discrete Math., Vol. 83 (1990) pp. 285?289.","journal-title":"Discrete Math."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0097-3165(86)90027-0","volume":"43","author":"H. Kimura","year":"1986","unstructured":"H. Kimura, Hadamard matrices of order 28 with automorphism groups of order two,J. Combin. Theory, Ser. A, Vol. 43 (1986) pp. 98?102.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"CR6","first-page":"153","volume":"10","author":"H. Kimura","year":"1994","unstructured":"H. Kimura, Extremal doubly even (56,28,12) codes and Hadamard matrices of order 28,Australasian J. Combin., Vol. 10 (1994) pp. 153?161.","journal-title":"Australasian J. Combin."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/S0019-9958(73)90273-8","volume":"22","author":"C. L. Mallows","year":"1973","unstructured":"C. L. Mallows and N. J. A. Sloane, An upper bond for self-dual codes,Inform. Control. Vol. 22 (1973) pp. 188?200.","journal-title":"Inform. Control."},{"key":"CR8","first-page":"171","volume":"25","author":"R. Mathon","year":"1988","unstructured":"R. Mathon, Symmetric (31,10,3) designs with non-trivial automorphism group,Ars Combin., Vol. 25 (1988) pp. 171?183.","journal-title":"Ars Combin."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TIT.1981.1056421","volume":"27","author":"G. Pasquier","year":"1981","unstructured":"G. Pasquier, A binary extremal doubly-even self-dual code (64,32,12) obtained from an extended Reed-Solomon code overF 16.IEEE. Trans. Inform. Theory, Vol. 27 (1981), pp. 807?808.","journal-title":"IEEE. Trans. Inform. Theory"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00124892","volume":"2","author":"E. Spence","year":"1992","unstructured":"E. Spence, A complete classification of symmetric (31,10,3) designs,Designs, Codes and Cryptography, Vol. 2 (1992) pp. 127?136.","journal-title":"Designs, Codes and Cryptography"},{"key":"CR11","unstructured":"E. Spence, Symmetric (31,10,3) designs with automorphism of odd order,J. Combin. Math. Combin. Comput., to appear."},{"key":"CR12","first-page":"461","volume":"43","author":"V. D. Tonchev","year":"1987","unstructured":"V. D. Tonchev, Symmetric 2-(31,10,3) designs with automorphisms of order seven,Annal. Discrete Math., Vol. 43 (1987) pp. 461?464.","journal-title":"Annal. Discrete Math."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0167-5060(08)70268-1","volume":"37","author":"V. D. Tonchev","year":"1988","unstructured":"V. D. Tonchev, Symmetric designs without ovals and extremal self-dual codes,Annal. Discrete Math., Vol. 37 (1988) pp. 451?458.","journal-title":"Annal. Discrete Math."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0097-3165(89)90030-7","volume":"52","author":"V. D. Tonchev","year":"1989","unstructured":"V. D. Tonchev, Self-orthogonal designs and extremal doubly-even codes,J. Combin. Theory, Ser. A, Vol. 52 (1989) pp. 197?205.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"CR15","first-page":"249","volume":"36","author":"V. D. Tonchev","year":"1993","unstructured":"V. D. Tonchev, Symmetric (31,10,3) designs with trivial automorphism group,Ars Combin., Vol. 36 (1993) pp. 249?254.","journal-title":"Ars Combin."},{"issue":"No. 4","key":"CR16","first-page":"35","volume":"22","author":"V. Yorgov","year":"1986","unstructured":"V. Yorgov, Doubly-even extremal codes of length 64,Problemi Peredatchi Informatsii, Vol. 22, No. 4 (1986) pp. 35?42 (in Russian) English translation in:Problems Inform. Transmission, (April 1987) pp. 277?284.","journal-title":"Problemi Peredatchi Informatsii"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01398007.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01398007\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01398007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T12:51:48Z","timestamp":1556801508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01398007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01398007"],"URL":"https:\/\/doi.org\/10.1007\/bf01398007","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}