{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:26:25Z","timestamp":1778099185092,"version":"3.51.4"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0012-365x(97)00250-1","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"127-136","source":"Crossref","is-referenced-by-count":38,"title":["Classification of extremal double-circulant self-dual codes of length up to 62"],"prefix":"10.1016","volume":"188","author":[{"given":"Masaaki","family":"Harada","sequence":"first","affiliation":[]},{"given":"T.Aaron","family":"Gulliver","sequence":"additional","affiliation":[]},{"given":"Hitoshi","family":"Kaneta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00250-1_BIB1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0012-365X(89)90286-0","article-title":"New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28","volume":"76","author":"Bussemaker","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00250-1_BIB2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/0097-3165(80)90057-6","article-title":"On the enumeration of self-dual codes","volume":"28","author":"Conway","year":"1980","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(97)00250-1_BIB3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0097-3165(92)90003-D","article-title":"The binary self-dual codes of length up to 32: a revised enumeration","volume":"60","author":"Conway","year":"1992","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(97)00250-1_BIB4","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1109\/18.59931","article-title":"A new upper bound on the minimal distance of self-dual codes","volume":"36","author":"Conway","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(97)00250-1_BIB5","article-title":"Construction of quasi-cyclic codes","author":"Gulliver","year":"1989"},{"key":"10.1016\/S0012-365X(97)00250-1_BIB6","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1109\/18.485739","article-title":"Weight enumerators of extremal singly even [60,30,12] codes","volume":"42","author":"Gulliver","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(97)00250-1_BIB7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1008276604233","article-title":"Weight enumerators of double circulant codes and new extremal self-dual codes","volume":"11","author":"Gulliver","year":"1997","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0012-365X(97)00250-1_BIB8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1027303722125","article-title":"Existence of new extremal doubly even codes and extremal singly even codes","volume":"8","author":"Harada","year":"1996","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0012-365X(97)00250-1_BIB9","unstructured":"M. Harada, New extremal ternary self-dual codes, Australas. J. Combin, to appear."},{"key":"10.1016\/S0012-365X(97)00250-1_BIB10","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TIT.1982.1056499","article-title":"Automorphisms of codes with applications to extremal doubly even codes of length 48","volume":"28","author":"Huffman","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(97)00250-1_BIB11","first-page":"171","article-title":"Extremal doubly even (56,28,12) codes and Hadamard matrices of order 28","volume":"10","author":"Kimura","year":"1994","journal-title":"Australas. J. Combin."},{"key":"10.1016\/S0012-365X(97)00250-1_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(71)90062-8","article-title":"Orthogonal circulant matrices over finite fields, and how to find them","volume":"10","author":"MacWilliams","year":"1971","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(97)00250-1_BIB13","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0012-365X(97)00250-1_BIB14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(72)90034-9","article-title":"A classification of self-orthogonal codes over GF(2)","volume":"3","author":"Pless","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00250-1_BIB15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0097-3165(75)90042-4","article-title":"On the classification and enumeration of self-dual codes","volume":"18","author":"Pless","year":"1975","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(97)00250-1_BIB16_1","first-page":"11","article-title":"Binary self-dual codes with automorphisms of odd order","volume":"19","author":"Yorgov","year":"1983","journal-title":"Probl. Pere. Inform."},{"key":"10.1016\/S0012-365X(97)00250-1_BIB16_2","first-page":"260","article-title":"Binary self-dual codes with automorphisms of odd order","volume":"19","author":"Yorgov","year":"1983","journal-title":"Problems Inform. Transm."},{"key":"10.1016\/S0012-365X(97)00250-1_BIB17","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/TIT.1987.1057273","article-title":"A method for constructing inequivalent self-dual codes with applications to length 56","volume":"33","author":"Yorgov","year":"1987","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002501?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002501?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T05:20:55Z","timestamp":1556169655000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97002501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X97002501"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00250-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}