{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:26:52Z","timestamp":1778099212063,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T00:00:00Z","timestamp":1690934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T00:00:00Z","timestamp":1690934400000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s40314-023-02407-6","type":"journal-article","created":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T17:01:43Z","timestamp":1690995703000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On reversible codes over a non-chain ring"],"prefix":"10.1007","volume":"42","author":[{"given":"Mohammad","family":"Ashraf","sequence":"first","affiliation":[]},{"given":"Washiqur","family":"Rehman","sequence":"additional","affiliation":[]},{"given":"Ghulam","family":"Mohammad","sequence":"additional","affiliation":[]},{"given":"Mohd","family":"Asim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,2]]},"reference":[{"key":"2407_CR1","unstructured":"Abualrub T (1988) Cyclic codes over the ring of integers mod $$m.$$ PhD Thesis, University of Iowa, Iowa City, IA, USA"},{"issue":"9","key":"2407_CR2","doi-asserted-by":"publisher","first-page":"2126","DOI":"10.1109\/TIT.2003.815763","volume":"49","author":"T Abualrub","year":"2003","unstructured":"Abualrub T, Oehmke R (2003) On the generators of $${\\mathbb{Z} }_{4}$$ cyclic codes of length $$2^{e}$$. IEEE Trans Inform Theory 49(9):2126\u20132133","journal-title":"IEEE Trans Inform Theory"},{"key":"2407_CR3","unstructured":"Abualrub T, Siap I (2006) Reversible quaternary cyclic codes. In: Proc. 9th WSEAS internat. conf. appl. math. Istanbul, Turkey, pp 441\u2013446"},{"issue":"3","key":"2407_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10623-006-9034-5","volume":"42","author":"T Abualrub","year":"2007","unstructured":"Abualrub T, Siap I (2007) Cyclic codes over the rings $${\\mathbb{Z} }_2+u{\\mathbb{Z} }_2$$ and $${\\mathbb{Z} }_2+u{\\mathbb{Z} }_2+u^{2}{\\mathbb{Z} }_2$$. Des Codes Cryptogr 42(3):273\u2013287","journal-title":"Des Codes Cryptogr"},{"key":"2407_CR5","first-page":"195","volume":"38","author":"T Abualrub","year":"2007","unstructured":"Abualrub T, Siap I (2007) Reversible cyclic codes over $${\\mathbb{Z} }_{4}$$. Austral J Combin 38:195\u2013205","journal-title":"Austral J Combin"},{"key":"2407_CR6","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L Adleman","year":"1994","unstructured":"Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021\u20131024","journal-title":"Science"},{"key":"2407_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1089\/cmb.1999.6.53","volume":"6","author":"L Adleman","year":"1999","unstructured":"Adleman L, Rothemund PWK, Roweis S, Winfree E (1999) On applying molecular computation to the data encryption standard. J Comput Biol 6:53\u201363","journal-title":"J Comput Biol"},{"issue":"5","key":"2407_CR8","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10623-019-00713-x","volume":"88","author":"S Bhowmick","year":"2020","unstructured":"Bhowmick S, Fotue-Tabue A, Martinez-Moro E, Bandi R, Bagchi S (2020) Do non-free LCD codes over finite commutative Frobenius rings exist? Des Codes Cryptogr 88(5):825\u2013840","journal-title":"Des Codes Cryptogr"},{"key":"2407_CR9","volume-title":"Handbook of magma functions","author":"W Bosma","year":"1995","unstructured":"Bosma W, Cannon J (1995) Handbook of magma functions. University of Sydney, Sydney"},{"key":"2407_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2018.06.002","volume":"773","author":"HQ Dinh","year":"2019","unstructured":"Dinh HQ, Singh AK, Pattanayak S, Sriboonchitta S (2019) Construction of cyclic DNA codes over the ring $${\\mathbb{Z} }_4[u]\/\\langle u^2-1\\rangle $$ based on the deletion distance. Theoret Comput Sci 773:27\u201342","journal-title":"Theoret Comput Sci"},{"key":"2407_CR11","doi-asserted-by":"publisher","first-page":"143285","DOI":"10.1109\/ACCESS.2020.3013958","volume":"8","author":"RT Eldin","year":"2020","unstructured":"Eldin RT, Matsui H (2020) On reversibility and self-duality for some classes of quasi-cyclic codes. IEEE Access 8:143285\u2013143293","journal-title":"IEEE Access"},{"key":"2407_CR12","unstructured":"Grassl M. Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de"},{"issue":"2","key":"2407_CR13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.3934\/amc.2017023","volume":"11","author":"F Gursoy","year":"2017","unstructured":"Gursoy F, Oztas ES, Siap I (2017) Reversible DNA codes over $${\\mathbb{F} }_{16}+u{\\mathbb{F} }_{16}+v{\\mathbb{F} }_{16}+uv{\\mathbb{F} }_{16},$$ Adv. Math Commun 11(2):307\u2013312","journal-title":"Math Commun"},{"issue":"2","key":"2407_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Hammons","year":"1994","unstructured":"Hammons AR, Kumar PV, Calderbank AR, Sloane NJA, Sole P (1994) The $${\\mathbb{Z} }_{4}$$-linearity of Kerdock, Preparata, Goethals and related codes. IEEE Trans Inform Theory 40(2):301\u2013319","journal-title":"IEEE Trans Inform Theory"},{"key":"2407_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/09720529.2019.1668145","volume":"24","author":"H Islam","year":"2021","unstructured":"Islam H, Prakash O (2021) Construction of reversible cyclic codes over $${\\mathbb{Z} }_{p^{k}},$$. J Discrete Math Sci Cryptogr 24:1\u201314","journal-title":"J Discrete Math Sci Cryptogr"},{"issue":"2","key":"2407_CR16","first-page":"117","volume":"19","author":"J Kaur","year":"2015","unstructured":"Kaur J, Dutt S, Schmi R (2015) Reversible and reversible complement cyclic codes over Galois rings. J Int Acad Phys Sci 19(2):117\u2013121","journal-title":"J Int Acad Phys Sci"},{"key":"2407_CR17","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, Dutt S, Schmi R (2020) Reversible complement cyclic codes over Galois rings with application to DNA codes. Discrete Appl Math 280:162\u2013170","journal-title":"Discrete Appl Math"},{"issue":"6","key":"2407_CR18","doi-asserted-by":"publisher","first-page":"1850090","DOI":"10.1142\/S1793524518500900","volume":"11","author":"N Kumar","year":"2018","unstructured":"Kumar N, Singh AK (2018) DNA computing over the ring $${\\mathbb{Z} _{4}[v]\/\\langle v^{2}-v\\rangle }$$. Int J Biomath 11(6):1850090","journal-title":"Int J Biomath"},{"key":"2407_CR19","unstructured":"Limbachiya D, Rao B, Gupta MK (2016) The art of DNA bases: sixteen years of DNA coding theory. arXiv:1607.00266v1"},{"key":"2407_CR20","doi-asserted-by":"crossref","unstructured":"Mansuripur M, Khulbe PK, Kuebler SM, Perry JW, Giridhar MS, Erwin JK, Seong K, Marder S, Peyghambarian N (2003) Information storage and retrieval using macromolecules as storage media. In: Proc. SPIE, 5069, optical data storage, 16 September","DOI":"10.1117\/12.533057"},{"issue":"3","key":"2407_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0019-9958(64)90438-3","volume":"7","author":"JL Massey","year":"1964","unstructured":"Massey JL (1964) Reversible codes. Inform Control 7(3):369\u2013380","journal-title":"Inform Control"},{"key":"2407_CR22","doi-asserted-by":"crossref","unstructured":"Milenkovic O, Kashyap N (2005) On the design of codes for DNA computing. In: Intern. workshop on coding and cryptography, pp 100\u2013119","DOI":"10.1007\/11779360_9"},{"key":"2407_CR23","first-page":"85","volume":"22","author":"SK Muttoo","year":"1986","unstructured":"Muttoo SK, Lal S (1986) A reversible code over $$GF(q)$$. Kybernetika 22:85\u201391","journal-title":"Kybernetika"},{"key":"2407_CR24","doi-asserted-by":"crossref","unstructured":"Oztas ES, Siap I, Yildiz B (2014) Reversible codes and application to DNA. In: Mathematical software ICMS: 4th international congress, Seoul, South Korea, Proceedings 4, August 5\u20139. Springer, Berlin, pp 124\u2013128","DOI":"10.1007\/978-3-662-44199-2_22"},{"issue":"4","key":"2407_CR25","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s11424-017-6301-7","volume":"31","author":"B Pang","year":"2018","unstructured":"Pang B, Zhu S, Sun Z (2018) On LCD negacyclic codes over finite fields. J Syst Sci Complex 31(4):1065\u20131077","journal-title":"J Syst Sci Complex"},{"key":"2407_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-021-01635-y","volume":"40","author":"O Prakash","year":"2021","unstructured":"Prakash O, Patel S, Yadav S (2021) Reversible cyclic codes over some finite rings and their application to DNA codes. Comput Appl Math 40:1\u201317","journal-title":"Comput Appl Math"},{"issue":"1","key":"2407_CR27","first-page":"52","volume":"6","author":"O Prakash","year":"2022","unstructured":"Prakash O, Yadav S, Sharma P (2022) Reversible cyclic codes over a class of chain rings and their application to DNA codes. Int J Inf Coding Theory 6(1):52\u201370","journal-title":"Int J Inf Coding Theory"},{"key":"2407_CR28","unstructured":"Srinivasulu B, Bhaintwal M (2015) Reversible cyclic codes over $${\\mathbb{F}}_4+u{\\mathbb{F}}_4$$ and their applications to DNA codes. In: 7th (ICITEE), pp 101\u2013105"},{"issue":"1","key":"2407_CR29","first-page":"79","volume":"4","author":"B Srinivasulu","year":"2017","unstructured":"Srinivasulu B, Bhaintwal M (2017) The structure of duals of cyclic codes over $${{\\mathbb{F} }}_2+u{{\\mathbb{F} }}_2+v{{\\mathbb{F} }}_2+uv{{\\mathbb{F} }}_2$$ and some DNA codes. Int J Inf Coding Theory 4(1):79\u2013100","journal-title":"Int J Inf Coding Theory"},{"issue":"5","key":"2407_CR30","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1970.1054517","volume":"16","author":"K Tzeng","year":"1970","unstructured":"Tzeng K, Hartmann C (1970) On the minimum distance of certain reversible cyclic codes. IEEE Trans Inform Theory 16(5):644\u2013646","journal-title":"IEEE Trans Inform Theory"},{"key":"2407_CR31","unstructured":"Xu X, Liu X (2011) On the structure of cyclic codes over $${\\mathbb{F}}_q+u{\\mathbb{F}}_q+v{\\mathbb{F}}_q+uv{\\mathbb{F}}_q$$. Wuhan Univ J Natl Sci 16(5)"},{"key":"2407_CR32","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10623-010-9399-3","volume":"58","author":"B Yildiz","year":"2011","unstructured":"Yildiz B, Karadeniz S (2011) Cyclic codes over $${{\\mathbb{F} }}_2+u{{\\mathbb{F} }}_2+v{{\\mathbb{F} }}_2+uv{{\\mathbb{F} }}_2$$. Des Codes Cryptogr 58:221\u2013234","journal-title":"Des Codes Cryptogr"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02407-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02407-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02407-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T09:59:57Z","timestamp":1702893597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02407-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,2]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["2407"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02407-6","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,2]]},"assertion":[{"value":"11 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 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 conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"269"}}