{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:02:11Z","timestamp":1772283731910,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T00:00:00Z","timestamp":1162425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T00:00:00Z","timestamp":1162425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s10623-006-9018-5","type":"journal-article","created":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T09:56:33Z","timestamp":1162374993000},"page":"93-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Extremal self-dual codes of length 64 through neighbors and covering radii"],"prefix":"10.1007","volume":"42","author":[{"given":"Naoki","family":"Chigira","sequence":"first","affiliation":[]},{"given":"Masaaki","family":"Harada","sequence":"additional","affiliation":[]},{"given":"Masaaki","family":"Kitazume","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,2]]},"reference":[{"key":"9018_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/TIT.1983.1056681","volume":"29","author":"EF Assmus Jr","year":"1993","unstructured":"Assmus EF, Jr, Pless V (1993) On the covering radius of extremal self-dual codes. IEEE Trans Inform Theory 29:359\u2013363","journal-title":"IEEE Trans Inform Theory"},{"key":"9018_CR2","first-page":"667","volume-title":"The CRC handbook of combinatorial designs.","author":"AE Brouwer","year":"1996","unstructured":"Brouwer AE (1996) Strongly regular graphs. In: Colbourn CJ, Dinitz JH, (eds), The CRC handbook of combinatorial designs. CRC Press, Boca Raton, pp 667\u2013685"},{"key":"9018_CR3","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/18.86979","volume":"37","author":"R Brualdi","year":"1991","unstructured":"Brualdi R, Pless V (1991) Weight enumerators of self-dual codes. IEEE Trans Inform Theory 37:1222\u20131225","journal-title":"IEEE Trans Inform Theory"},{"key":"9018_CR4","unstructured":"Chigira N, Harada M, Kitazume M, Permutation groups and binary self-orthogonal codes. J. Algebra (to appear)"},{"key":"9018_CR5","unstructured":"Chigira N, Harada M, Kitazume M, Some self-dual codes invariant under the Hall-Janko group (submitted)"},{"key":"9018_CR6","volume-title":"Atlas of finite groups","author":"JH Conway","year":"1985","unstructured":"Conway JH, Curtis RT, Norton SP, Parker RA, Wilson RA (1985) Atlas of finite groups. Clarendon Press, Oxford"},{"key":"9018_CR7","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1109\/18.59931","volume":"36","author":"JH Conway","year":"1990","unstructured":"Conway JH, Sloane NJA (1990) A new upper bound on the minimal distance of self-dual codes. IEEE Trans Inform Theory 36:1319\u20131333","journal-title":"IEEE Trans Inform Theory"},{"key":"9018_CR8","unstructured":"Harada M, Munemasa A, Shadows, neighbors and covering radii of extremal self-dual codes (preprint)"},{"key":"9018_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.ffa.2005.05.012","volume":"11","author":"WC Huffman","year":"2005","unstructured":"Huffman WC (2005) On the classification and enumeration of self-dual codes. Finite Fields Appl 11:451\u2013490","journal-title":"Finite Fields Appl"},{"key":"9018_CR10","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0019-9958(73)90273-8","volume":"22","author":"CL Mallows","year":"1973","unstructured":"Mallows CL, Sloane NJA (1973) An upper bound for self-dual codes. Inform Control 22:188\u2013200","journal-title":"Inform Control"},{"key":"9018_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/18.651000","volume":"44","author":"EM Rains","year":"1998","unstructured":"Rains EM (1998) Shadow bounds for self-dual codes. IEEE Trans Inform Theory 44:134\u2013139","journal-title":"IEEE Trans Inform Theory"},{"key":"9018_CR12","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S0747-7171(03)00031-2","volume":"35","author":"CM Roney-Dougal","year":"2003","unstructured":"Roney-Dougal CM, Unger WR (2003) The primitive affine groups of degree less than 1000. J Symbolic Comput. 35:421\u2013439","journal-title":"J Symbolic Comput."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9018-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-006-9018-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9018-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9018-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T01:09:25Z","timestamp":1652576965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-006-9018-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["9018"],"URL":"https:\/\/doi.org\/10.1007\/s10623-006-9018-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,2]]},"assertion":[{"value":"23 June 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2006","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2006","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2006","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}