{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:54Z","timestamp":1772283594089,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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,4]]},"DOI":"10.1023\/a:1008206223659","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"25-35","source":"Crossref","is-referenced-by-count":18,"title":["Classification of Extremal Double Circulant Formally Self-Dual Even 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":"125554_CR1","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":"125554_CR2","unstructured":"S. T. Dougherty, M. Harada and M. Oura, Shadows and formally self-dual codes (submitted)."},{"key":"125554_CR3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0097-3165(94)90004-3","volume":"67","author":"G. T. Kennedy","year":"1994","unstructured":"G. T. Kennedy, Weight distributions of linear codes and the Gleason-Pierce theorem, J. Combin. Theory Ser. A, Vol. 67 (1994) pp. 72\u201388.","journal-title":"J. Combin. Theory Ser. A"},{"key":"125554_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01388559","volume":"4","author":"G. T. Kennedy","year":"1994","unstructured":"G. T. Kennedy and V. Pless, On designs and formally self-dual codes, Des. Codes and Cryptogr., Vol. 4 (1994) pp. 43\u201355.","journal-title":"Des. Codes and Cryptogr."},{"key":"125554_CR5","unstructured":"M. Harada, The existence of a self-dual [70, 35, 12] code and formally self-dual codes, Finite Fields and Their Appl. (to appear)."},{"key":"125554_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":"125554_CR7","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":"125554_CR8","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 bound for self-dual codes, Inform. Control, Vol. 22 (1973) pp. 188\u2013200.","journal-title":"Inform. Control"},{"key":"125554_CR9","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0012-365X(92)90574-Y","volume":"106\/107","author":"J. Simonis","year":"1992","unstructured":"J. Simonis, The [18, 9, 6] code is unique, Discrete Math., Vol. 106\/107 (1992) pp. 439\u2013448.","journal-title":"Discrete Math."},{"key":"125554_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0097-3165(76)90071-6","volume":"21","author":"H. N. Ward","year":"1976","unstructured":"H. N. Ward, A restriction on the weight enumerator of a self-dual code, J. Combin. Theory Ser. A, Vol. 21 (1976) pp. 253\u2013255.","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008206223659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008206223659\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008206223659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:58:10Z","timestamp":1753757890000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008206223659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["125554"],"URL":"https:\/\/doi.org\/10.1023\/a:1008206223659","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}