{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T15:26:47Z","timestamp":1767108407660,"version":"3.45.0"},"reference-count":32,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T00:00:00Z","timestamp":1763769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004242","name":"Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia","doi-asserted-by":"publisher","award":["PNURSP2025R231"],"award-info":[{"award-number":["PNURSP2025R231"]}],"id":[{"id":"10.13039\/501100004242","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Let e be a fixed positive integer and n1,n2 be odd positive integers. The main objective of this article is to investigate the algebraic structure of double cyclic codes of length (n1,n2) over the finite chain ring Re\u00a0=\u00a0F4e+vF4e, where v2=0. Building upon this structural framework, we further demonstrate the construction of DNA codes derived from these double cyclic codes over Re. In addition, we provide the necessary and sufficient criteria showing that these codes possess reversibility and reverse-complement properties over Re. Furthermore, we introduce a generalized Gray map that extends the classical Gray map from the ring F2+vF2 with v2=0 to the ring Re, showing a direct correspondence between elements of Re and DNA sequences over S={A,T,G,C} utilizing double cyclic codes. To illustrate the applicability of our results, we present some examples demonstrating the effectiveness of the mapping in generating reversible and reverse-complement DNA codes from algebraic structures over the ring Re.<\/jats:p>","DOI":"10.3390\/e27121187","type":"journal-article","created":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T09:02:07Z","timestamp":1763974927000},"page":"1187","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Double Cyclic Codes over Finite Chain Rings for DNA Computing"],"prefix":"10.3390","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5162-7522","authenticated-orcid":false,"given":"Shakir","family":"Ali","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Aligarh Muslim University, Aligarh 202002, India"},{"name":"Institute of Mathematical Sciences, Faculty of Science, Universiti Malaya, Kuala Lumpur 50603, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7856-2861","authenticated-orcid":false,"given":"Amal S.","family":"Alali","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5066-5946","authenticated-orcid":false,"given":"Mohd","family":"Azeem","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Aligarh Muslim University, Aligarh 202002, India"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2371-5707","authenticated-orcid":false,"given":"Atif Ahmad","family":"Khan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Aligarh Muslim University, Aligarh 202002, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5640-4432","authenticated-orcid":false,"given":"Kok Bin","family":"Wong","sequence":"additional","affiliation":[{"name":"Institute of Mathematical Sciences, Faculty of Science, Universiti Malaya, Kuala Lumpur 50603, Malaysia"}]}],"member":"1968","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","article-title":"Molecular computation of solutions to combinatorial problems","volume":"266","author":"Adleman","year":"1994","journal-title":"Science"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1038\/nature02551","article-title":"An autonomous molecular computer for logical control of gene expression","volume":"429","author":"Benenson","year":"2004","journal-title":"Nature"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1090\/dimacs\/027\/04","article-title":"Breaking DES using a molecular computer","volume":"Volume 27","author":"Boneh","year":"1996","journal-title":"DNA Based Computers"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0304-3975(99)00100-0","article-title":"Using DNA to solve the bounded Post correspondence problem","volume":"231","author":"Kari","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1126\/science.7725098","article-title":"DNA solution of hard computational problems","volume":"268","author":"Lipton","year":"1995","journal-title":"Science"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1089\/10665270152530818","article-title":"On combinatorial DNA word design","volume":"8","author":"Marathe","year":"2001","journal-title":"J. Comput. Biol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.2298\/FIL1303459O","article-title":"Lifted polynomials over F16 and their applications to DNA codes","volume":"27","author":"Oztas","year":"2013","journal-title":"Filomat"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.1080\/00207160.2014.930449","article-title":"On a generalization of lifted polynomials over finite fields and their applications to DNA codes","volume":"92","author":"Oztas","year":"2015","journal-title":"Int. J. Comput. Math."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.tcs.2004.11.004","article-title":"Linear constructions for DNA codes","volume":"334","author":"Gaborit","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s12190-015-0892-8","article-title":"On cyclic DNA codes over F2 + uF2","volume":"51","author":"Liang","year":"2016","journal-title":"J. Appl. Math. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.jfranklin.2006.02.009","article-title":"Construction of cyclic codes over F4 for DNA computing","volume":"343","author":"Abualrub","year":"2006","journal-title":"J. Franklin Inst."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.jfranklin.2009.07.002","article-title":"Cyclic DNA codes over the ring F2[u]\/\u2329u2 \u2212 1\u232a based on the deletion distance","volume":"346","author":"Siap","year":"2009","journal-title":"J. Franklin Inst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s00200-013-0188-x","article-title":"Construction of cyclic codes over F2 + uF2 for DNA computing","volume":"24","author":"Guenda","year":"2013","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10623-015-0100-8","article-title":"Codes over F4 + vF4 and some DNA applications","volume":"80","author":"Bayram","year":"2016","journal-title":"Des. Codes Cryptogr."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s12190-016-1046-3","article-title":"Cyclic DNA codes over F2 + uF2 + vF2 + uvF2 and their applications","volume":"55","author":"Zhu","year":"2017","journal-title":"J. Appl. Math. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1016\/j.camwa.2011.12.029","article-title":"Cyclic DNA codes over the ring F2[u]\/\u2329u4 \u2212 1\u232a and applications to DNA codes","volume":"63","author":"Yildiz","year":"2012","journal-title":"Comput. Math. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"111200","DOI":"10.1109\/ACCESS.2020.3001283","article-title":"Construction of cyclic DNA codes over the ring \u21244 + v\u21244","volume":"8","author":"Liu","year":"2020","journal-title":"IEEE Access"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Prakash, O., Singh, A., Verma, R.K., Sol\u00e9, P., and Cheng, W. (2023). DNA code from cyclic and skew cyclic codes over F4[v]\/\u2329v3\u232a. Entropy, 25.","DOI":"10.3390\/e25020239"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Dinh, H.Q., Pathak, S., Upadhyay, A.K., and Yamaka, W. (2020). New DNA codes from cyclic codes over mixed alphabets. Mathematics, 8.","DOI":"10.3390\/math8111977"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"190049","DOI":"10.1109\/ACCESS.2020.3032078","article-title":"A study of FqR-cyclic codes and their applications in constructing quantum codes","volume":"8","author":"Dinh","year":"2020","journal-title":"IEEE Access"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"7232","DOI":"10.1109\/TIT.2021.3111858","article-title":"\u21242\u21244-additive quasi-cyclic codes","volume":"67","author":"Shi","year":"2021","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"113382","DOI":"10.1016\/j.disc.2023.113382","article-title":"Gray images of cyclic codes over \u2124p2 and \u2124p\u2124p2","volume":"346","author":"Wang","year":"2023","journal-title":"Discrete Math."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"102605","DOI":"10.1016\/j.ffa.2025.102605","article-title":"Bound on the minimum distance of double circulant cubic residue codes","volume":"105","author":"Shi","year":"2025","journal-title":"Finite Fields Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10623-017-0334-8","article-title":"\u21242-double cyclic codes","volume":"86","author":"Borges","year":"2018","journal-title":"Des. Codes Cryptogr."},{"key":"ref_25","first-page":"24","article-title":"The structure of generalized quasi-cyclic codes","volume":"5","author":"Siap","year":"2005","journal-title":"Appl. Math. E-Notes"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00200-021-00538-z","article-title":"Fq2-double cyclic codes with respect to the Hermitian inner product","volume":"35","author":"Aydogdu","year":"2024","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Deng, T., and Yang, J. (2020). Double cyclic codes over Fq + vFq. Mathematics, 8.","DOI":"10.3390\/math8101820"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.ffa.2016.02.003","article-title":"On double cyclic codes over \u21244","volume":"39","author":"Gao","year":"2016","journal-title":"Finite Fields Appl."},{"key":"ref_29","first-page":"145","article-title":"Double cyclic codes over Fq + uFq + u2Fq","volume":"3","author":"Yao","year":"2015","journal-title":"Int. J. Inf. Coding Theory"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1109\/LCOMM.2020.2992501","article-title":"\u21244-double cyclic codes are asymptotically good","volume":"24","author":"Gao","year":"2020","journal-title":"IEEE Commun. Lett."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1089\/cmb.2022.0151","article-title":"Constructing double cyclic codes over F2 + uF2 for DNA codes","volume":"30","author":"Kanlaya","year":"2023","journal-title":"J. Comput. Biol."},{"key":"ref_32","unstructured":"Bosma, W., and Cannon, J.J. (1996). Handbook of Magma Functions, School of Mathematics and Statistics, University of Sydney."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/12\/1187\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T16:34:08Z","timestamp":1764088448000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/12\/1187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,22]]},"references-count":32,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["e27121187"],"URL":"https:\/\/doi.org\/10.3390\/e27121187","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,11,22]]}}}