{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:39:52Z","timestamp":1740148792590,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T00:00:00Z","timestamp":1688774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T00:00:00Z","timestamp":1688774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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-01893-5","type":"journal-article","created":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T22:01:25Z","timestamp":1688853685000},"page":"3553-3578","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Linear codes over $$\\mathbb {F}_q\\times (\\mathbb {F}_q+v\\mathbb {F}_q)$$"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3861-8784","authenticated-orcid":false,"given":"Mevl\u00fct","family":"Tekkoyun","sequence":"first","affiliation":[]},{"given":"Erg\u00fcn","family":"Yaraneri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"1893_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s12095-020-00461-z","volume":"13","author":"R Aksoy","year":"2021","unstructured":"Aksoy, R., \u00c7al\u0131\u015fkan, F.: Self-dual codes over $${\\mathbb{F} } _2\\times ({\\mathbb{F} } _2+v{\\mathbb{F} } _2)$$. Cryptogr. Commun. 13, 129\u2013141 (2021)","journal-title":"Cryptogr. Commun."},{"key":"1893_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s12190-018-01216-z","volume":"60","author":"I Aydogdu","year":"2019","unstructured":"Aydogdu, I., Gursoy, F.: $$\\mathbb{Z} _2 \\mathbb{Z} _4 \\mathbb{Z} _8$$-Cyclic codes. J. Appl. Math. Comput. 60, 327\u2013341 (2019)","journal-title":"J. Appl. Math. Comput."},{"key":"1893_CR3","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TIT.2003.822576","volume":"50","author":"K Bestsumiya","year":"2004","unstructured":"Bestsumiya, K., Harada, M.: Optimal self-dual codes over $${\\mathbb{F} }_2 \\times {\\mathbb{F} }_2$$. IEEE Trans. Inf. Theory 50, 356\u2013358 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1893_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1022540524423","volume":"28","author":"K Bestsumiya","year":"2003","unstructured":"Bestsumiya, K., Gulliver, T.A., Harada, M.: Extremal self-dual codes over $${\\mathbb{F} }_2 \\times {\\mathbb{F} }_2$$. Des. Codes Cryptogr. 28, 171\u2013186 (2003)","journal-title":"Des. Codes Cryptogr."},{"key":"1893_CR5","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1109\/18.761278","volume":"45","author":"A Bonnecaze","year":"1999","unstructured":"Bonnecaze, A., Udaya, P.: Cyclic codes and self-dual codes over $${\\mathbb{F} }_2 + u{\\mathbb{F} }_2$$. IEEE Trans. Inf. Theory 45, 1250\u20131255 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1893_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00200-019-00397-9","volume":"31","author":"F \u00c7al\u0131\u015fkan","year":"2020","unstructured":"\u00c7al\u0131\u015fkan, F., Aksoy, R.: Linear codes over $${\\mathbb{F} } _2\\times ({\\mathbb{F} } _2+v{\\mathbb{F} } _2)$$ and the MacWilliams identities. Appl. Algebra Eng. Commun. Comput. 31, 135\u2013147 (2020)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1893_CR7","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1109\/18.796375","volume":"45","author":"ST Dougherty","year":"1999","unstructured":"Dougherty, S.T., Gaborit, P., Harada, M., Sole, P.: Type IV self-codes over rings. IEEE Trans. Inf. Theory 45, 2345\u20132360 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1893_CR8","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1007\/s12190-021-01580-3","volume":"68","author":"F Gursoy","year":"2022","unstructured":"Gursoy, F., Aydogdu, I.: $$\\mathbb{Z} _2 \\mathbb{Z} _4[ ]$$-skew cyclic codes. J. Appl. Math. Comput. 68, 1613\u20131633 (2022)","journal-title":"J. Appl. Math. Comput."},{"key":"1893_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Hammons","year":"1994","unstructured":"Hammons, A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., Sole, P.: The $$\\mathbb{Z} _4$$-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40, 301\u2013319 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1893_CR10","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Graduate Texts in Mathematics, vol. 84, 2nd edn. (1984)"},{"key":"1893_CR11","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1109\/18.782165","volume":"45","author":"P Udaya","year":"1999","unstructured":"Udaya, P., Bonnecaze, A.: Decoding of cyclic codes over $${\\mathbb{F} }_2+u{\\mathbb{F} }_2$$. IEEE Trans. Inf. Theory 45, 2148\u20132157 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1893_CR12","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1353\/ajm.1999.0024","volume":"121","author":"J Wood","year":"1999","unstructured":"Wood, J.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121, 555\u2013575 (1999)","journal-title":"Am. J. Math."},{"key":"1893_CR13","doi-asserted-by":"crossref","unstructured":"Zhu, S., Wang, Y., Shi, M.: Cyclic codes over $${\\mathbb{F}}_2 + v{\\mathbb{F}}_2$$. In: IEEE International Symposium on Information Theory\u2014Proceedings, pp. 1719\u20131722 (2009)","DOI":"10.1109\/ISIT.2009.5205757"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01893-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01893-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01893-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T21:13:35Z","timestamp":1729718015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01893-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,8]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1893"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01893-5","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,7,8]]},"assertion":[{"value":"26 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 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":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}