{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:26:27Z","timestamp":1778099187471,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T00:00:00Z","timestamp":1549065600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00200-019-00381-3","type":"journal-article","created":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T07:43:16Z","timestamp":1549093396000},"page":"403-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On extremal double circulant self-dual codes of lengths 90\u201396"],"prefix":"10.1007","volume":"30","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","published-online":{"date-parts":[[2019,2,2]]},"reference":[{"key":"381_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symb. Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"381_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10623-006-9018-5","volume":"42","author":"N Chigira","year":"2007","unstructured":"Chigira, N., Harada, M., Kitazume, M.: Extremal self-dual codes of length 64 through neighbors and covering radii. Des. Codes Cryptogr. 42, 93\u2013101 (2007)","journal-title":"Des. Codes Cryptogr."},{"key":"381_CR3","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1109\/18.59931","volume":"36","author":"JH Conway","year":"1990","unstructured":"Conway, J.H., Sloane, N.J.A.: A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inform. Theory 36, 1319\u20131333 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"381_CR4","unstructured":"Dontcheva, R., Russeva, R., Ziapkov, N.: On the binary extremal codes of length 92. In: Proceedings of International Workshop Optimal Codes and Related Topics, Sunny Beach, Bulgaria, pp. 53\u201358 (2001)"},{"key":"381_CR5","doi-asserted-by":"publisher","first-page":"2036","DOI":"10.1109\/18.641574","volume":"43","author":"ST Dougherty","year":"1997","unstructured":"Dougherty, S.T., Gulliver, T.A., Harada, M.: Extremal binary self-dual codes. IEEE Trans. Inform. Theory 43, 2036\u20132047 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"381_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/S1071-5797(03)00011-X","volume":"9","author":"P Gaborit","year":"2003","unstructured":"Gaborit, P., Otmani, A.: Experimental constructions of self-dual codes. Finite Fields Appl. 9, 372\u2013394 (2003)","journal-title":"Finite Fields Appl."},{"key":"381_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/ffta.2001.0333","volume":"8","author":"P Gaborit","year":"2002","unstructured":"Gaborit, P., Pless, V., Sol\u00e9, P., Atkin, O.: Type II codes over \n                    \n                      \n                    \n                    $$\\mathbb{F}_4$$\n                    \n                      \n                        \n                          F\n                          4\n                        \n                      \n                    \n                  . Finite Fields Appl. 8, 171\u2013183 (2002)","journal-title":"Finite Fields Appl."},{"key":"381_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1008276604233","volume":"11","author":"TA Gulliver","year":"1997","unstructured":"Gulliver, T.A., Harada, M.: Weight enumerators of double circulant codes and new extremal self-dual codes. Des. Codes Cryptogr. 11, 141\u2013150 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"381_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1008249924142","volume":"13","author":"TA Gulliver","year":"1998","unstructured":"Gulliver, T.A., Harada, M.: Classification of extremal double circulant self-dual codes of lengths 64 to 72. Des. Codes Cryptogr. 13, 257\u2013269 (1998)","journal-title":"Des. Codes Cryptogr."},{"key":"381_CR10","doi-asserted-by":"publisher","first-page":"2064","DOI":"10.1016\/j.disc.2006.05.004","volume":"306","author":"TA Gulliver","year":"2006","unstructured":"Gulliver, T.A., Harada, M.: Classification of extremal double circulant self-dual codes of lengths 74\u201388. Discrete Math. 306, 2064\u20132072 (2006)","journal-title":"Discrete Math."},{"key":"381_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/18.749016","volume":"45","author":"TA Gulliver","year":"1999","unstructured":"Gulliver, T.A., Senkevitch, N.: On a class of self-dual codes derived from quadratic residues. IEEE Trans. Inform. Theory 45, 701\u2013702 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"381_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0012-365X(97)00250-1","volume":"188","author":"M Harada","year":"1998","unstructured":"Harada, M., Gulliver, T.A., Kaneta, H.: Classification of extremal double-circulant self-dual codes of length up to 62. Discrete Math. 188, 127\u2013136 (1998)","journal-title":"Discrete Math."},{"key":"381_CR13","doi-asserted-by":"publisher","first-page":"1612","DOI":"10.1109\/TIT.2010.2040967","volume":"56","author":"M Harada","year":"2010","unstructured":"Harada, M., Kiermaier, M., Wassermann, A., Yorgova, R.: New binary singly even self-dual codes. IEEE Trans. Inform. Theory 56, 1612\u20131617 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"381_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.3934\/amc.2007.1.261","volume":"1","author":"M Harada","year":"2007","unstructured":"Harada, M., Nishimura, T.: An extremal singly even self-dual code of length 88. Adv. Math. Commun. 1, 261\u2013267 (2007)","journal-title":"Adv. Math. Commun."},{"key":"381_CR15","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0019-9958(73)90273-8","volume":"22","author":"CL Mallows","year":"1973","unstructured":"Mallows, C.L., Sloane, N.J.A.: An upper bound for self-dual codes. Inform. Control 22, 188\u2013200 (1973)","journal-title":"Inform. Control"},{"key":"381_CR16","unstructured":"Moore, E.H.: Double circulant codes and related structures, Ph.D. dissertation. Dartmouth College, Hanover, NH (1976)"},{"key":"381_CR17","doi-asserted-by":"crossref","unstructured":"Yorgova, R.: Binary self-dual extremal codes of length 92. In: Proceedings of IEEE International Symposium on Information Theory, Seattle, WA, pp. 1292\u20131295 (2006)","DOI":"10.1109\/ISIT.2006.262034"},{"key":"381_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10623-007-9152-8","volume":"48","author":"R Yorgova","year":"2008","unstructured":"Yorgova, R., Wassermann, A.: Binary self-dual codes with automorphisms of order 23. Des. Codes Cryptogr. 48, 155\u2013164 (2008)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-019-00381-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00381-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00381-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T19:23:08Z","timestamp":1580584988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-019-00381-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,2]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s00200-019-00381-3","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,2]]},"assertion":[{"value":"24 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}