{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:12:57Z","timestamp":1773231177121,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1008289725040","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"39-48","source":"Crossref","is-referenced-by-count":16,"title":["On the Binary Self-Dual Codes with an Automorphism of Order 2"],"prefix":"10.1007","volume":"12","author":[{"given":"Stefka","family":"Buyuklieva","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"136845_CR1","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/18.86979","volume":"37","author":"R. A. Brualdi","year":"1991","unstructured":"R. A. Brualdi and V. Pless, Weight enumerators of self-dual codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 1222\u20131225.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136845_CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(90)90208-Y","volume":"82","author":"F. C. Bussemaker","year":"1990","unstructured":"F. C. Bussemaker 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\u2013321.","journal-title":"Discrete Math."},{"key":"136845_CR3","unstructured":"St. Buyuklieva, Existence of certain extremal self-dual codes of lengths 42 and 44: Proceedings of the International Workshop OCRT, Sozopol, Bulgaria (1995) pp. 29\u201331."},{"key":"136845_CR4","unstructured":"St. Buyuklieva and V. Yorgov, Singly-even self-dual codes of length 40, Designs, Codes and Cryptography (to appear)."},{"key":"136845_CR5","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1109\/18.59931","volume":"36","author":"J. H. Conway","year":"1991","unstructured":"J. H. Conway and N. J. A. Sloane, A new upper bound on the minimal distance of self-dual codes, IEEE Trans. Inform. Theory, Vol. 36 (1991) pp. 1319\u20131333.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136845_CR6","unstructured":"T. A. Gulliver and M. Harada, Weight enumerators of double circulant codes and new extremal self-dual codes, preprint."},{"key":"136845_CR7","unstructured":"M. Harada, T. A. Gulliver and H. Kaneta, Classification of extremal double circulant self-dual codes of length up to 62, preprint."},{"key":"136845_CR8","first-page":"1","volume":"8","author":"M. Harada","year":"1996","unstructured":"M. Harada, Existence of new extremal double-even codes and extremal singly-even codes, Designs, Codes and Cryptography, Vol. 8 (1996) pp. 1\u201312.","journal-title":"Designs, Codes and Cryptography"},{"key":"136845_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01398007","volume":"6","author":"M. Harada","year":"1995","unstructured":"M. Harada and H. Kimura, New extremal doubly-even [64, 32, 12] codes, Designs, Codes and Cryptography, Vol. 6 (1995) pp. 91\u201396.","journal-title":"Designs, Codes and Cryptography"},{"key":"136845_CR10","doi-asserted-by":"crossref","unstructured":"M. Harada and V. D. Tonchev, Singly-even self-dual codes and Hadamard matrices, Lecture Notes in Computer Science, Vol. 948 (1995) pp. 279\u2013284.","DOI":"10.1007\/3-540-60114-7_20"},{"key":"136845_CR11","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TIT.1982.1056499","volume":"28","author":"W. C. Huffman","year":"1982","unstructured":"W. C. Huffman, Automorphisms of codes with application to extremal doubly-even codes of length 48, IEEE Trans. Inform. Theory, Vol. 28 (1982) pp. 511\u2013521.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136845_CR12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(90)90012-7","volume":"83","author":"S. Kapralov","year":"1990","unstructured":"S. Kapralov and V. Tonchev, Extremal doubly-even codes of length 64 derived from symmetric designs, Discrete Math., Vol. 83 (1990) pp. 285\u2013289.","journal-title":"Discrete Math."},{"key":"136845_CR13","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, Amsterdam, The Netherlands (1977)."},{"key":"136845_CR14","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 over F\n16, IEEE Trans. Inform. Theory, Vol. 27 (1981) pp. 807\u2013808.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136845_CR15","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/18.179361","volume":"39","author":"V. Pless","year":"1993","unstructured":"V. Pless, V. Tonchev and J. Leon, On the existence of a certain [64, 32, 12] extremal code, IEEE Trans. Inform. Theory, Vol. 39 (1993) pp. 214\u2013215.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136845_CR16","first-page":"99","volume":"29","author":"R. Ruseva","year":"1993","unstructured":"R. Ruseva and V. Yorgov, Two exceptional extremal codes (in Russian), Probl. Pered. Inform., Vol. 29 (1993) pp. 99\u2013103.","journal-title":"Probl. Pered. Inform."},{"key":"136845_CR17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0012-365X(92)90716-S","volume":"110","author":"E. Spence","year":"1992","unstructured":"E. Spence and V. D. Tonchev, Extremal self-dual codes from symmetric designs, Discrete Math., Vol. 110 (1992) pp. 265\u2013268.","journal-title":"Discrete Math."},{"key":"136845_CR18","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\u2013205.","journal-title":"J. Combin. Theory"},{"key":"136845_CR19","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/18.119711","volume":"38","author":"H. P. Tsai","year":"1992","unstructured":"H. P. Tsai, Existence of certain extremal self-dual codes, IEEE Trans. Inform. Theory, Vol. 38 (1992) pp. 501\u2013504.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136845_CR20","first-page":"11","volume":"19","author":"V. Y. Yorgov","year":"1983","unstructured":"V. Y. Yorgov, Binary self-dual codes with automorphisms of odd order (in Russian), Probl. Pered. Inform., Vol. 19 (1983) pp. 11\u201324.","journal-title":"Probl. Pered. Inform."},{"key":"136845_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TIT.1987.1057273","volume":"33","author":"V. Y. Yorgov","year":"1987","unstructured":"V. Y. Yorgov, A method for constructing inequivalent self-dual codes with applications to length 56, IEEE Trans. Inform. Theory, Vol. 33 (1987) pp. 77\u201382.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136845_CR22","first-page":"277","volume":"22","author":"V. Y. Yorgov","year":"1986","unstructured":"V. Y. Yorgov, Doubly-even extremal codes of length 64 (in Russian), Probl. Pered. Inform., Vol. 22 (1986) pp. 277\u2013284.","journal-title":"Probl. Pered. Inform."},{"key":"136845_CR23","unstructured":"V. Y. Yorgov, New extremal singly-even self-dual codes of length 44: Proceedings of the Sixth Joint Swedish-Russian International Workshop on Information Theory, Sweden (1993) pp. 372\u2013375."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008289725040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008289725040\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008289725040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:32:08Z","timestamp":1753756328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008289725040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["136845"],"URL":"https:\/\/doi.org\/10.1023\/a:1008289725040","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}