{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:25Z","timestamp":1740122545765,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T00:00:00Z","timestamp":1636070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T00:00:00Z","timestamp":1636070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2019R1A2C1088676","NRF-2019R1I1A1A01057755"],"award-info":[{"award-number":["NRF-2019R1A2C1088676","NRF-2019R1I1A1A01057755"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10623-021-00968-3","type":"journal-article","created":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T14:02:59Z","timestamp":1636120979000},"page":"2735-2751","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An improved upper bound on self-dual codes over finite fields GF(11),\u00a0GF(19), and GF(23)"],"prefix":"10.1007","volume":"90","author":[{"given":"Whan Hyuk","family":"Choi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0517-9359","authenticated-orcid":false,"given":"Jon Lark","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,5]]},"reference":[{"issue":"3","key":"968_CR1","doi-asserted-by":"publisher","first-page":"733","DOI":"10.4171\/JEMS\/316","volume":"14","author":"S Ball","year":"2012","unstructured":"Ball S.: On sets of vectors of a finite vector space in which every subset of basis size is a basis. J. Eur. Math. Soc. 14(3), 733\u2013748 (2012).","journal-title":"J. Eur. Math. Soc."},{"issue":"4","key":"968_CR2","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1109\/18.761269","volume":"45","author":"E Bannai","year":"1999","unstructured":"Bannai E., Dougherty S.T., Harada M., Oura M.: Type II codes, even unimodular lattices, and invariant rings. IEEE Trans. Inform. Theory 45(4), 1194\u20131205 (1999).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"968_CR3","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1109\/TCOMM.2019.2955724","volume":"68","author":"I Be\u2019Ery","year":"2019","unstructured":"Be\u2019Ery I., Raviv N., Raviv T., Be\u2019Ery Y.: Active deep decoding of linear codes. IEEE Trans. Commun. 68(2), 728\u2013736 (2019).","journal-title":"IEEE Trans. Commun."},{"issue":"1\u20133","key":"968_CR4","first-page":"175","volume":"148","author":"R Bernhard","year":"1996","unstructured":"Bernhard R.: Codes and Siegel modular forms. Discret. Math. 148(1\u20133), 175\u2013204 (1996).","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"968_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0012-365X(02)00520-4","volume":"262","author":"K Betsumiya","year":"2003","unstructured":"Betsumiya K., Georgiou S., Gulliver T.A., Harada M.: On self-dual codes over some prime fields. Discret. Math. 262(1\u20133), 37\u201358 (2003).","journal-title":"Discret. Math."},{"key":"968_CR6","volume-title":"Playoust: An Introduction to Magma","author":"J Cannon","year":"1994","unstructured":"Cannon J.: Playoust: An Introduction to Magma. University of Sydney, Sydney (1994)."},{"issue":"10","key":"968_CR7","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.3390\/math8101644","volume":"8","author":"S \u00c7alkavur","year":"2020","unstructured":"\u00c7alkavur S., Sol\u00e9 P.: Secret sharing, zero sum sets, and Hamming codes. Mathematics 8(10), 1644 (2020).","journal-title":"Mathematics"},{"key":"968_CR8","doi-asserted-by":"publisher","first-page":"104294","DOI":"10.1109\/ACCESS.2021.3099434","volume":"9","author":"W-H Choi","year":"2021","unstructured":"Choi W.-H., Kim J.-L.: Self-dual codes, symmetric matrices, and eigenvectors. IEEE Access 9, 104294\u2013104303 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3099434.","journal-title":"IEEE Access"},{"key":"968_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6568-7","volume-title":"Sphere Packings, Lattices and Groups","author":"JH Conway","year":"1999","unstructured":"Conway J.H., Sloane N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn Springer, New York (1999).","edition":"3"},{"key":"968_CR10","doi-asserted-by":"publisher","first-page":"101692","DOI":"10.1016\/j.ffa.2020.101692","volume":"67","author":"ST Dougherty","year":"2020","unstructured":"Dougherty S.T., Gildea J., Kaya A.: $$2^n$$ Bordered constructions of self-dual codes from group rings. Finite Fields Appl. 67, 101692 (2020).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"968_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF00124590","volume":"9","author":"MA De Boer","year":"1996","unstructured":"De Boer M.A.: Almost MDS codes. Des. Codes Cryptogr. 9(2), 143\u2013155 (1996).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"968_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jcta.2001.3198","volume":"97","author":"P Gaborit","year":"2002","unstructured":"Gaborit P.: Quadratic double circulant codes over fields. J. Comb. Theory Ser. A 97(1), 85\u2013107 (2002).","journal-title":"J. Comb. Theory Ser. A"},{"key":"968_CR13","doi-asserted-by":"crossref","unstructured":"Grassl M.D.: On self-dual MDS codes. In: ISIT 2008, Toronto, Canada, July 6\u201311, pp. 1954\u20131957 (2008).","DOI":"10.1109\/ISIT.2008.4595330"},{"issue":"1","key":"968_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-009-9267-1","volume":"52","author":"M Grassl","year":"2009","unstructured":"Grassl M., Gulliver T.A.: On circulant self-dual codes over small fields. Des. Codes Cryptogr. 52(1), 57 (2009). https:\/\/doi.org\/10.1007\/s10623-009-9267-1.","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"968_CR15","doi-asserted-by":"publisher","first-page":"4354","DOI":"10.1109\/TIT.2008.928297","volume":"54","author":"TA Gulliver","year":"2008","unstructured":"Gulliver T.A., Kim J.-L., Lee Y.: New MDS or near-MDS self-dual codes. IEEE Trans. Inform. Theory 54(9), 4354\u20134360 (2008).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"968_CR16","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/jcd.21556","volume":"25","author":"M Harada","year":"2017","unstructured":"Harada M., Munemasa A., Tonchev V.D.: Self-dual codes and the nonexistence of a quasi-symmetric 2-(37, 9, 8) design with intersection numbers 1 and 3. J. Comb. Des. 25(10), 469\u2013476 (2017).","journal-title":"J. Comb. Des."},{"key":"968_CR17","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2010","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2010)."},{"issue":"1","key":"968_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/TCOMM.2019.2951403","volume":"68","author":"L Huang","year":"2019","unstructured":"Huang L., Zhang H., Li R., Ge Y., Wang J.: AI coding: learning to construct error correction codes. IEEE Trans. Commun. 68(1), 26\u201339 (2019).","journal-title":"IEEE Trans. Commun."},{"key":"968_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ffa.2018.04.013","volume":"52","author":"HJ Kim","year":"2018","unstructured":"Kim H.J., Lee Y.: Extremal quasi-cyclic self-dual codes over finite fields. Finite Fields Appl. 52, 301\u2013318 (2018).","journal-title":"Finite Fields Appl."},{"key":"968_CR20","unstructured":"Kim J.-L.: Generator matrices for this paper. https:\/\/cicagolab.sogang.ac.kr\/cicagolab\/2657.html."},{"issue":"5","key":"968_CR21","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ffa.2011.02.010","volume":"17","author":"YH Park","year":"2011","unstructured":"Park Y.H.: The classification of self-dual modular codes. Finite Fields Appl. 17(5), 442\u2013460 (2011).","journal-title":"Finite Fields Appl."},{"issue":"1","key":"968_CR22","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/0097-3165(75)90072-2","volume":"18","author":"V Pless","year":"1975","unstructured":"Pless V.: Symmetry codes and their invariant subcodes. J. Comb. Theory Ser. A 18(1), 116\u2013125 (1975).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"968_CR23","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0097-3165(72)90088-X","volume":"12","author":"V Pless","year":"1972","unstructured":"Pless V.: Symmetry codes over GF (3) and new five-designs. J. Comb. Theory Ser. A 12(1), 119\u2013142 (1972).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"968_CR24","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/MSP.2017.3151345","volume":"15","author":"N Sendrier","year":"2017","unstructured":"Sendrier N.: Code-based cryptography: state of the art and perspectives. IEEE Secur. Privacy 15(4), 44\u201350 (2017).","journal-title":"IEEE Secur. Privacy"},{"key":"968_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.ffa.2018.08.011","volume":"54","author":"M Shi","year":"2018","unstructured":"Shi M., Sok L., Sol\u00e9 P., \u00c7alkavur S.: Self-dual codes and orthogonal matrices over large finite fields. Finite Fields Appl. 54, 297\u2013314 (2018).","journal-title":"Finite Fields Appl."},{"issue":"6","key":"968_CR26","doi-asserted-by":"publisher","first-page":"2954877","DOI":"10.1109\/TIT.2019.2954877","volume":"66","author":"L Sok","year":"2020","unstructured":"Sok L.: Explicit constructions of MDS self-dual codes. IEEE Trans. Inform. Theory 66(6), 2954877 (2020). https:\/\/doi.org\/10.1109\/TIT.2019.2954877.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"968_CR27","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/s10623-021-00847-x","volume":"89","author":"L Sok","year":"2021","unstructured":"Sok L.: New families of self-dual codes. Des. Codes Cryptogr. 89, 823\u2013841 (2021). https:\/\/doi.org\/10.1007\/s10623-021-00847-x.","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00968-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00968-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00968-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T16:20:52Z","timestamp":1666887652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00968-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,5]]},"references-count":27,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["968"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00968-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2021,11,5]]},"assertion":[{"value":"15 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}