{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:39:50Z","timestamp":1740148790353,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T00:00:00Z","timestamp":1683849600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T00:00:00Z","timestamp":1683849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071001"],"award-info":[{"award-number":["12071001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s12190-023-01854-y","type":"journal-article","created":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T10:04:07Z","timestamp":1683885847000},"page":"3021-3037","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Classification of type I codes over $${\\mathbb {F}}_{4}+u{\\mathbb {F}}_{4}$$"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4990-6271","authenticated-orcid":false,"given":"Minjia","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixiao","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon-Lark","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,12]]},"reference":[{"key":"1854_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0012-365X(03)00097-9","volume":"275","author":"K Betsumiya","year":"2004","unstructured":"Betsumiya, K., Ling, S., Nemenzo, F.R.: Type II codes over $${\\mathbb{F} }_{2^m}+u{\\mathbb{F} }_{2^m}$$. Discrete Math. 275, 43\u201365 (2004)","journal-title":"Discrete Math."},{"key":"1854_CR2","volume-title":"An Introduction to Magma","author":"J Cannon","year":"1994","unstructured":"Cannon, J., Playoust, C.: An Introduction to Magma. University of Sydney, Sydney (1994)"},{"issue":"1","key":"1854_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/18.746770","volume":"45","author":"ST Dougherty","year":"1999","unstructured":"Dougherty, S.T., Gaborit, P., Harada, M., Sol\u00e9, P.: Type II codes over $${\\mathbb{F} }_2+u{\\mathbb{F} }_2$$. IEEE Trans. Inform. Theory 45(1), 32\u201345 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1854_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ffa.2009.11.004","volume":"16","author":"ST Dougherty","year":"2010","unstructured":"Dougherty, S.T., Kim, J.-L., Kulosman, H., Liu, H.: Self-dual codes over commutative Frobenius rings. Finite Fields Their Appl. 16, 14\u201326 (2010)","journal-title":"Finite Fields Their Appl."},{"issue":"2","key":"1854_CR5","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 $${\\mathbb{F} }_4$$. Finite Fields Their Appl. 8(2), 171\u2013183 (2002)","journal-title":"Finite Fields Their Appl."},{"issue":"4","key":"1854_CR6","first-page":"873","volume":"13","author":"LE Galvez","year":"2020","unstructured":"Galvez, L.E., Betty, R.A., Nemenzo, F.: Self-orthogonal codes over $${\\mathbb{F} }_q+u {\\mathbb{F} }_q$$ and $${\\mathbb{F} }_q+u{\\mathbb{F} }_q+u^2 {\\mathbb{F} }_q$$. Eur. J. Appl. Math. 13(4), 873\u2013892 (2020)","journal-title":"Eur. J. Appl. Math."},{"issue":"1","key":"1854_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jcta.2003.10.003","volume":"105","author":"J-L Kim","year":"2004","unstructured":"Kim, J.-L., Lee, Y.: Euclidean and Hermitian self-dual MDS codes over large finite fields. J. Combin. Theory Ser. A 105(1), 79\u201395 (2004)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"1854_CR8","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1007\/s12190-021-01598-7","volume":"68","author":"J-L Kim","year":"2022","unstructured":"Kim, J.-L., Ohk, D.E.: DNA codes over two noncommutative rings of order four. J. Appl. Math. Comput. 68(3), 2015\u20132038 (2022)","journal-title":"J. Appl. Math. Comput."},{"issue":"3","key":"1854_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.jcta.2007.07.001","volume":"115","author":"H Lee","year":"2008","unstructured":"Lee, H., Lee, Y.: Construction of self-dual codes over finite rings $$\\mathbb{Z}_{p^m}$$. J. Combin. Theory Ser. A 115(3), 407\u2013422 (2008)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1854_CR10","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1006\/eujc.2001.0509","volume":"22","author":"S Ling","year":"2001","unstructured":"Ling, S., Sol\u00e9, P.: Type II codoes over $${\\mathbb{F} }_4+ u{\\mathbb{F} }_4$$. Eur. J. Comb. 22, 983\u2013997 (2001)","journal-title":"Eur. J. Comb."},{"key":"1854_CR11","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1090\/S0002-9904-1974-13662-1","volume":"80","author":"V Pless","year":"1974","unstructured":"Pless, V., Sloane, N.J.A.: Binary self-dual codes of length 24. Bull. Am. Math. Soc. 80, 1173\u20131178 (1974)","journal-title":"Bull. Am. Math. Soc."},{"issue":"5","key":"1854_CR12","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.jfranklin.2012.05.014","volume":"350","author":"M Shi","year":"2013","unstructured":"Shi, M., Zhu, S., Yang, S.: A class of optimal $$p$$-ary codes from one-weight codes over $$\\mathbb{F} _p[u]\/\\langle u^m \\rangle $$. J. Frankl. Inst. 350(5), 729\u2013737 (2013)","journal-title":"J. Frankl. Inst."},{"key":"1854_CR13","doi-asserted-by":"crossref","unstructured":"Shi, M., Qian, L., Sok, L., Aydin, N., Sol\u00e9, P.: On constacyclic codes over $$\\mathbb{Z}_4[u]\/\\langle u^2-1 \\rangle $$ and their Gray images. Finite Fields Their Appl. 45, 86\u201395 (2017)","DOI":"10.1016\/j.ffa.2016.11.016"},{"issue":"10","key":"1854_CR14","doi-asserted-by":"publisher","first-page":"6240","DOI":"10.1109\/TIT.2017.2742499","volume":"63","author":"M Shi","year":"2017","unstructured":"Shi, M., Guan, Y., Sol\u00e9, P.: Two new families of two-weight codes. IEEE Trans. Inform. Theory. 63(10), 6240\u20136246 (2017)","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"5","key":"1854_CR15","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12095-016-0206-5","volume":"9","author":"M Shi","year":"2017","unstructured":"Shi, M., Wu, R., Liu, Y., Sol\u00e9, P.: Two and three weight codes over $$\\mathbb{F} _p+u\\mathbb{F} _p$$. Cryptogr. Commun. 9(5), 637\u2013646 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"6","key":"1854_CR16","doi-asserted-by":"publisher","first-page":"3842","DOI":"10.1109\/TIT.2018.2883759","volume":"65","author":"M Shi","year":"2019","unstructured":"Shi, M., Wu, R., Krotov, D.S.: On $$\\mathbb{Z} _p\\mathbb{Z} _{p^k}$$-additive codes and their duality. IEEE Trans. Inform. Theory. 65(6), 3842\u20133847 (2019)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"1854_CR17","doi-asserted-by":"publisher","unstructured":"Shi, M., Li, S., Kim, J.-L.: Two conjectures on the largest minimum distances of binary self-orthogonal codes with dimension 5. IEEE Trans. Inform. Theory. (2023). https:\/\/doi.org\/10.1109\/TIT.2023.3250718","DOI":"10.1109\/TIT.2023.3250718"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01854-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01854-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01854-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T19:24:52Z","timestamp":1689794692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01854-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1854"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01854-y","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,5,12]]},"assertion":[{"value":"6 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Our data can be obtained from the authors upon reasonable request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data Deposition Information"}}]}}