{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T09:05:28Z","timestamp":1767949528297,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T00:00:00Z","timestamp":1720828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T00:00:00Z","timestamp":1720828800000},"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":["AAECC"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00200-024-00667-1","type":"journal-article","created":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T23:24:05Z","timestamp":1720826645000},"page":"47-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DNA codes over $$GR(2^{3},d)[X]\/\\langle X^{2},2X \\rangle$$"],"prefix":"10.1007","volume":"37","author":[{"given":"C.","family":"\u00c1lvarez-Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. A.","family":"Castillo-Guill\u00e9n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Badaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,13]]},"reference":[{"key":"667_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112404","author":"C \u00c1lvarez-Garc\u00eda","year":"2021","unstructured":"\u00c1lvarez-Garc\u00eda, C., Castillo-Guill\u00e9n, C.A.: DNA codes over finite local Frobenius non-chain rings of length $$4$$. Discret. Math. (2021). https:\/\/doi.org\/10.1016\/j.disc.2021.112404","journal-title":"Discret. Math."},{"issue":"1","key":"667_CR2","first-page":"89","volume":"30","author":"C \u00c1lvarez-Garc\u00eda","year":"2022","unstructured":"\u00c1lvarez-Garc\u00eda, C., Castillo-Guill\u00e9n, C.A.: DNA codes over finite local Frobenius non-chain rings of length $$5$$ and nilpotency index $$4$$. An. Stiint. Univ. Ovidius Constanta Ser. Mat. 30(1), 89\u2013108 (2022)","journal-title":"An. Stiint. Univ. Ovidius Constanta Ser. Mat."},{"issue":"2","key":"667_CR3","first-page":"25","volume":"29","author":"C \u00c1lvarez-Garc\u00eda","year":"2021","unstructured":"\u00c1lvarez-Garc\u00eda, C., Castillo-Guill\u00e9n, C.A.: Self dual reversible and complementary duals constacyclic codes over finite local Frobenius non-chain rings of length $$5$$ and nilpotency index $$4$$. An. Stiint. Univ. Ovidius Constanta Ser. Mat. 29(2), 25\u201350 (2021)","journal-title":"An. Stiint. Univ. Ovidius Constanta Ser. Mat."},{"key":"667_CR4","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.jfranklin.2006.02.009","volume":"343","author":"T Abualrub","year":"2006","unstructured":"Abualrub, T., Ghrayeb, A., Zeng, X.N.: Construction of cyclic codes over $$GF(4)$$ for DNA computing. J. Frankl. Inst. 343, 448\u2013457 (2006)","journal-title":"J. Frankl. Inst."},{"key":"667_CR5","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L Adleman","year":"1994","unstructured":"Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"667_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10623-015-0100-8","volume":"80","author":"A Bayram","year":"2016","unstructured":"Bayram, A., Oztas, E.S., Siap, I.: Codes over $$\\mathbb{F} _{4}+v\\mathbb{F} _{4}$$ and some DNA applications. Des. Codes Cryptogr. 80, 379\u2013393 (2016)","journal-title":"Des. Codes Cryptogr."},{"key":"667_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2016.08.004","volume":"43","author":"CA Castillo-Guill\u00e9n","year":"2017","unstructured":"Castillo-Guill\u00e9n, C.A., Renter\u00eda-M\u00e1rquez, C., Tapia-Recillas, H.: Constacyclic codes over finite local Frobenius non-chain rings with nilpotency index $$3$$. Finite Fields Their Appl. 43, 1\u201321 (2017)","journal-title":"Finite Fields Their Appl."},{"key":"667_CR8","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.disc.2019.05.001","volume":"342","author":"CA Castillo-Guill\u00e9n","year":"2019","unstructured":"Castillo-Guill\u00e9n, C.A., Renter\u00eda-M\u00e1rquez, C., Sarmiento, E., Villareal, R., Tapia-Recillas, H.: The dual of a constacyclic code, constacyclic self dual, constacyclic reversible and constacyclic codes with complementary duals over finite local Frobenius non-chain rings of nilpotency index $$3$$. Discret. Math. 342, 2283\u20132296 (2019)","journal-title":"Discret. Math."},{"key":"667_CR9","doi-asserted-by":"publisher","first-page":"1728","DOI":"10.1109\/TIT.2004.831789","volume":"50","author":"HQ Dinh","year":"2004","unstructured":"Dinh, H.Q., L\u00f3pez-Permouth, S.R.: Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inf. Theory 50, 1728\u20131744 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"667_CR10","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1007\/s10623-017-0405-x","volume":"86","author":"HQ Dinh","year":"2018","unstructured":"Dinh, H.Q., Singh, A.K., Pattanayak, S., Sriboonchitta, S.: Cyclic DNA codes over the ring $$\\mathbb{F} _{2}+u\\mathbb{F} _{2}+v\\mathbb{F} _{2}+uv\\mathbb{F} _{2}+v^{2}\\mathbb{F} _{2}+uv^{2}\\mathbb{F} _{2}$$. Des. Codes Cryptogr. 86, 1451\u20131467 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"667_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2004.11.004","volume":"334","author":"P Gaborit","year":"2005","unstructured":"Gaborit, P., King, O.D.: Linear constructions for DNA codes. Theor. Comput. Sci. 334, 99\u2013113 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"667_CR12","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s00200-013-0188-x","volume":"24","author":"K Guenda","year":"2013","unstructured":"Guenda, K., Gulliver, T.A.: Construction of cyclic codes over $$\\mathbb{F} _{2}+u\\mathbb{F} _{2}$$ for DNA computing. Appl. Algebra Engrg. Comm. Comput. 24, 445\u2013459 (2013)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"667_CR13","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/S0092-8240(87)90018-8","volume":"49","author":"T Head","year":"1987","unstructured":"Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biol. 49, 737\u2013759 (1987)","journal-title":"Bull. Math. Biol."},{"key":"667_CR14","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.dam.2020.01.004","volume":"280","author":"J Kaur","year":"2020","unstructured":"Kaur, J., Sehmi, R., Dutt, S.: Reversible complement cyclic codes over Galois rings with application to DNA codes. Discret. Appl. Math. 280, 162\u2013170 (2020)","journal-title":"Discret. Appl. Math."},{"key":"667_CR15","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1998)"},{"key":"667_CR16","volume-title":"Commutative Ring Theory","author":"H Matsumura","year":"1986","unstructured":"Matsumura, H.: Commutative Ring Theory. Cambridge University Press, Cambridge (1986)"},{"key":"667_CR17","volume-title":"Finite Rings with Identity","author":"BR McDonald","year":"1974","unstructured":"McDonald, B.R.: Finite Rings with Identity. Marcel Dekker, New York (1974)"},{"key":"667_CR18","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/j.jfranklin.2009.07.002","volume":"346","author":"I Siap","year":"2009","unstructured":"Siap, I., Abualrub, T., Ghrayeb, A.: Cyclic DNA codes over the ring $$\\mathbb{F} _{2}[u]\/\\langle u^{2}-1\\rangle$$ based on the deletion distance. J. Frankl. Inst. 346, 731\u2013740 (2009)","journal-title":"J. Frankl. Inst."},{"key":"667_CR19","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1016\/j.camwa.2011.12.029","volume":"63","author":"B Yildiz","year":"2012","unstructured":"Yildiz, B., Siap, I.: Cyclic codes over $$\\mathbb{F} _{2}[u]\/\\langle u^{4}-1\\rangle$$ and applications to DNA codes. Comput. Math. Appl. 63, 1169\u20131176 (2012)","journal-title":"Comput. Math. Appl."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00667-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-024-00667-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00667-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T07:14:35Z","timestamp":1767942875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-024-00667-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,13]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["667"],"URL":"https:\/\/doi.org\/10.1007\/s00200-024-00667-1","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,13]]},"assertion":[{"value":"11 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2024","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 declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}