{"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":1772283594081,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,9,26]],"date-time":"2007-09-26T00:00:00Z","timestamp":1190764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2007,10,17]]},"DOI":"10.1007\/s10623-007-9127-9","type":"journal-article","created":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T11:20:50Z","timestamp":1190719250000},"page":"335-346","source":"Crossref","is-referenced-by-count":10,"title":["On binary self-dual codes of lengths 60, 62, 64 and 66 having an automorphism of order 9"],"prefix":"10.1007","volume":"45","author":[{"given":"Radka","family":"Russeva","sequence":"first","affiliation":[]},{"given":"Nikolay","family":"Yankov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,26]]},"reference":[{"key":"9127_CR1","unstructured":"Bouyukliev I.: An algorithm for finding isomorphisms of codes. In: Proceedings of Third Workshop OCRT\u20192001, pp. 35\u201340. Sunny Beach, Bulgaria (2001)."},{"key":"9127_CR2","first-page":"25","volume":"19","author":"S. Bouyuklieva","year":"2005","unstructured":"Bouyuklieva S., Russeva R., Yankov N. (2005). Binary self-dual codes having an automorphism of order p 2. Mathematica Balkanica, New Series 19, 25\u201331","journal-title":"Mathematica Balkanica, New Series"},{"key":"9127_CR3","doi-asserted-by":"crossref","first-page":"3678","DOI":"10.1109\/TIT.2005.855616","volume":"51","author":"S. Bouyuklieva","year":"2005","unstructured":"Bouyuklieva S., Russeva R., Yankov N. (2005). On the structure of binary self-dual codes having an automorphism of order a square of an odd prime. IEEE Trans. Inform. Theory 51, 3678\u20133686","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR4","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1109\/18.59931","volume":"36","author":"J.H. Conway","year":"1990","unstructured":"Conway J.H., Sloane N.J.A. (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":"9127_CR5","doi-asserted-by":"crossref","first-page":"2060","DOI":"10.1109\/TIT.2002.1013144","volume":"48","author":"R.A. Dontcheva","year":"2002","unstructured":"Dontcheva R.A., Harada M. (2002). New extremal self-dual codes of length 62 and related extremal self-dual codes. IEEE Trans. Inform. Theory 48, 2060\u20132064","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/TIT.2003.822598","volume":"50","author":"R.A. Dontcheva","year":"2004","unstructured":"Dontcheva R.A., van Zanten A.J., Dodunekov S.M. (2004). Binary self-dual codes with automorphisms of composite order. IEEE Trans. Inform. Theory 50, 311\u2013318","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR7","doi-asserted-by":"crossref","first-page":"2036","DOI":"10.1109\/18.641574","volume":"43","author":"S.T. Dougherty","year":"1997","unstructured":"Dougherty S.T., Gulliver T.A., Harada M. (1997). Extremal binary self-dual codes. IEEE Trans. Inform. Theory 43, 2036\u20132047","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR8","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1109\/18.485739","volume":"42","author":"T.A. Gulliver","year":"1996","unstructured":"Gulliver T.A., Harada M. (1996). Weight enumerators of extremal singly-even [60,30,12] codes. IEEE Trans. Inform. Theory 42, 658\u2013659","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1008249924142","volume":"13","author":"T.A. Gulliver","year":"1998","unstructured":"Gulliver T.A., Harada M. (1998). Classification of extremal double circulant self-dual codes of lengths 64 to 72. Des. Codes Cryptogr. 13, 257\u2013269","journal-title":"Des. Codes Cryptogr."},{"key":"9127_CR10","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1109\/18.761274","volume":"45","author":"M. Harada","year":"1999","unstructured":"Harada M. (1999). Construction of an extremal self-dual codes of length 62. IEEE Trans. Inform. Theory 45, 1232\u20131233","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR11","doi-asserted-by":"crossref","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. (1998). Classification of extremal double circulant self-dual codes of length up to 62. Discrete Math. 188, 127\u2013136","journal-title":"Discrete Math."},{"key":"9127_CR12","first-page":"113","volume":"21","author":"M. Harada","year":"2007","unstructured":"Harada M., Nishimura T., Yorgova R. (2007). New extremal self-dual codes of length 66. Mathematika Balkanica 21, 113\u2013121","journal-title":"Mathematika Balkanica"},{"key":"9127_CR13","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TIT.1982.1056499","volume":"28","author":"W.C. Huffman","year":"1982","unstructured":"Huffman W.C. (1982). Automorphisms of codes with application to extremal doubly-even codes of length 48. IEEE Trans. Inform. Theory 28, 511\u2013521","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR14","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/j.ffa.2005.05.012","volume":"11","author":"W.C. Huffman","year":"2005","unstructured":"Huffman W.C. (2005). On the classification and enumeration of self-dual codes. Finite Fields and Their Applications 11, 451\u2013490","journal-title":"Finite Fields and Their Applications"},{"key":"9127_CR15","doi-asserted-by":"crossref","first-page":"2751","DOI":"10.1109\/18.959257","volume":"47","author":"S. Ling","year":"2001","unstructured":"Ling S., Sole P. (2001). On the algebraic structure of quasi-cyclic codes I: Finite fields. IEEE Trans. Inform. Theory 47, 2751\u20132760","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR16","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/18.119711","volume":"38","author":"H.P. Tsai","year":"1992","unstructured":"Tsai H.P. (1992). Existence of certain extremal self-dual codes. IEEE Trans. Inform. Theory 38, 501\u2013504","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR17","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1109\/18.782156","volume":"45","author":"H.P. Tsai","year":"1999","unstructured":"Tsai H.P. (1999). Extremal self-dual codes of length 66 and 68. IEEE Trans. Inform. Theory 45, 2129\u20132133","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR18","unstructured":"Tsai H.P., Shih P.Y., Su W.K., Chen C.H.: Cosets of Self-Dual Codes. Des. Codes Cryptogr. (Submitted)."},{"key":"9127_CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TIT.1987.1057273","volume":"33","author":"V.Y. Yorgov","year":"1987","unstructured":"Yorgov V.Y. (1987). A method for constructing inequivalent self-dual codes with applications to length 56. IEEE Trans. Inform. Theory 33, 77\u201382","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9127_CR20","first-page":"13","volume":"4","author":"V.Y. Yorgov","year":"1983","unstructured":"Yorgov V.Y. (1983). Binary self-dual codes with an automorphism of odd order. Problems Inform.Transm. 4, 13\u201324 (in Russian)","journal-title":"Problems Inform.Transm."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9127-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9127-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9127-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:50:08Z","timestamp":1559231408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9127-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,26]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,10,17]]}},"alternative-id":["9127"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9127-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,26]]}}}