{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T22:19:32Z","timestamp":1777587572754,"version":"3.51.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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,5]]},"DOI":"10.1023\/a:1008276604233","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"141-150","source":"Crossref","is-referenced-by-count":17,"title":["Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes"],"prefix":"10.1007","volume":"11","author":[{"given":"T. Aaron","family":"Gulliver","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaaki","family":"Harada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"129334_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. S. Pless, Weight enumerators of self-dual codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 1222\u20131225.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129334_CR2","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1109\/18.59931","volume":"36","author":"J. H. Conway","year":"1990","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 (1990) pp. 1319\u20131333.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129334_CR3","unstructured":"T. A. Gulliver, Construction of quasi-cyclic codes, Ph.D. dissertation, University of Victoria (1989)."},{"key":"129334_CR4","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1109\/18.485739","volume":"42","author":"T. A. Gulliver","year":"1996","unstructured":"T. A. Gulliver and M. Harada, Weight enumerators of extremal singly-even [60, 30, 12] codes, IEEE Trans. Inform. Theory, Vol. 42 (1996) pp. 658\u2013659.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129334_CR5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1027303722125","volume":"8","author":"M. Harada","year":"1996","unstructured":"M. Harada, Existence of new extremal doubly-even codes and extremal singly-even codes, Des. Codes and Cryptogr., Vol. 8 (1996) pp. 273\u2013283.","journal-title":"Des. Codes and Cryptogr."},{"key":"129334_CR6","unstructured":"M. Harada, T. A. Gulliver and H. Kaneta, Classification of extremal double circulant self-dual codes of length up to 62 (submitted)."},{"key":"129334_CR7","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 applications 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":"129334_CR8","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 (1977)."},{"key":"129334_CR9","doi-asserted-by":"crossref","first-page":"1829","DOI":"10.1109\/18.165461","volume":"38","author":"H-P. Tsai","year":"1992","unstructured":"H-P. Tsai, Existence of some extremal self-dual codes, IEEE Trans. Inform. Theory, Vol. 38 (1992) pp. 1829\u20131833.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"129334_CR10","first-page":"99","volume":"29","author":"V. Yorgov","year":"1993","unstructured":"V. Yorgov and R. Ruseva, Two extremal codes of length 42 and 44, Probl. Pered. Inform., Vol. 29 (1993) pp. 99\u2013103 (in Russian). English translation in: Probl. Inform. Transm., Vol. 29 (1994) pp. 385\u2013388.","journal-title":"Probl. Pered. Inform."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008276604233.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008276604233\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008276604233.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:27:29Z","timestamp":1753756049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008276604233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["129334"],"URL":"https:\/\/doi.org\/10.1023\/a:1008276604233","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}