{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T10:11:32Z","timestamp":1695463892708},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T00:00:00Z","timestamp":1573603200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T00:00:00Z","timestamp":1573603200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11786-019-00417-4","type":"journal-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T08:03:57Z","timestamp":1573632237000},"page":"423-429","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Binary Isodual Codes Having an Automorphism of Odd Prime Order"],"prefix":"10.1007","volume":"14","author":[{"given":"Stefka","family":"Bouyuklieva","sequence":"first","affiliation":[]},{"given":"Radka","family":"Russeva","sequence":"additional","affiliation":[]},{"given":"Emine","family":"Karatash","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,13]]},"reference":[{"key":"417_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/A:1011203416769","volume":"23","author":"K Betsumiya","year":"2001","unstructured":"Betsumiya, K., Harada, M.: Binary optimal odd formally self-dual codes. Des. Codes Cryptogr. 23, 11\u201322 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"417_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.55630\/sjc.2007.1.115-130","volume":"1","author":"I Bouyukliev","year":"2007","unstructured":"Bouyukliev, I.: What is Q-Extension? Serdica J. Comput. 1, 115\u2013130 (2007)","journal-title":"Serdica J. Comput."},{"key":"417_CR3","doi-asserted-by":"publisher","first-page":"4253","DOI":"10.1109\/TIT.2015.2440266","volume":"61","author":"I Bouyukliev","year":"2015","unstructured":"Bouyukliev, I., Dzhumalieva-Stoeva, M., Monev, V.: Classification of binary self-dual codes of length 40. IEEE Trans. Inf. Theory 61, 4253\u20134258 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"417_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.3934\/amc.2010.4.433","volume":"4","author":"S Bouyuklieva","year":"2010","unstructured":"Bouyuklieva, S., Bouyukliev, I.: Classification of the extremal formally self-dual even codes of length 30. Adv. Math. Commun. 4, 433\u2013439 (2010)","journal-title":"Adv. Math. Commun."},{"key":"417_CR5","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1109\/18.59931","volume":"36","author":"JH Conway","year":"1991","unstructured":"Conway, J.H., Sloane, N.J.A.: A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inf. Theory 36, 1319\u20131333 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"417_CR6","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de. Accessed 8 Oct 2019"},{"key":"417_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disc.2003.10.027","volume":"283","author":"TA Gulliver","year":"2004","unstructured":"Gulliver, T.A., \u00d6sterg\u00e5rd, P.R.J.: Binary optimal linear rate 1\/2 codes. Discrete Math. 283, 255\u2013261 (2004)","journal-title":"Discrete Math."},{"key":"417_CR8","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s003730200037","volume":"18","author":"M Harada","year":"2002","unstructured":"Harada, M., \u00d6sterg\u00e5rd, P.R.J.: Classification of extremal formally self-dual even codes of length 22. Graphs Comb. 18, 507\u2013516 (2002)","journal-title":"Graphs Comb."},{"key":"417_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/TIT.1982.1056499","volume":"28","author":"WC Huffman","year":"1982","unstructured":"Huffman, W.C.: Automorphisms of codes with application to extremal doubly-even codes of lenght 48. IEEE Trans. Inf. Theory 28, 511\u2013521 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"417_CR10","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TIT.1986.1057233","volume":"32","author":"WC Huffman","year":"1986","unstructured":"Huffman, W.C.: Decomposing and shortening codes using automorphisms. IEEE Trans. Inf. Theory 32, 833\u2013836 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"417_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"417_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0012-365X(99)00135-1","volume":"223","author":"DB Jaffe","year":"2000","unstructured":"Jaffe, D.B.: Optimal binary linear codes of length $$\\le \\,30$$. Discrete Math. 223, 135\u2013155 (2000)","journal-title":"Discrete Math."},{"key":"417_CR13","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.ffa.2017.01.005","volume":"45","author":"HJ Kim","year":"2017","unstructured":"Kim, H.J., Lee, Y.: Construction of isodual codes over $$GF(q)$$. Finite Fields Their Appl. 45, 372\u2013385 (2017)","journal-title":"Finite Fields Their Appl."},{"key":"417_CR14","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/18.959257","volume":"47","author":"S Ling","year":"2001","unstructured":"Ling, S., Sole, P.: On the algebraic structure of quasi-cyclic codes I: finite fields. IEEE Trans. Inf. Theory 47, 2751\u20132760 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"107","key":"417_CR15","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0012-365X(92)90574-Y","volume":"106","author":"J Simonis","year":"1992","unstructured":"Simonis, J.: The [18, 9, 6] code is unique. Discrete Math. 106(107), 439\u2013448 (1992)","journal-title":"Discrete Math."},{"key":"417_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10623-010-9444-2","volume":"61","author":"S Han","year":"2011","unstructured":"Han, S., Lee, H., Lee, Y.: Binary formally self-dual odd codes. Des. Codes Cryptogr. 61, 141\u2013150 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"417_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TIT.1987.1057273","volume":"33","author":"V Yorgov","year":"1987","unstructured":"Yorgov, V.: A method for constructing inequivalent self-dual codes with applications to length 56. IEEE Trans. Inf. Theory 33, 77\u201382 (1987)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-019-00417-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-019-00417-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-019-00417-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T21:42:26Z","timestamp":1695418946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-019-00417-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,13]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["417"],"URL":"https:\/\/doi.org\/10.1007\/s11786-019-00417-4","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,13]]},"assertion":[{"value":"21 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}