{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:42:04Z","timestamp":1768750924768,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T00:00:00Z","timestamp":1656028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T00:00:00Z","timestamp":1656028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10623-022-01067-7","type":"journal-article","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T10:03:51Z","timestamp":1656065031000},"page":"1679-1694","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reversible $$G^k$$-codes with applications to DNA codes"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5206-6480","authenticated-orcid":false,"given":"Adrian","family":"Korban","sequence":"first","affiliation":[]},{"given":"Serap","family":"\u015eahinkaya","sequence":"additional","affiliation":[]},{"given":"Deniz","family":"Ustun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"key":"1067_CR1","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.disc.2011.11.021","volume":"312","author":"N Aboluion","year":"2012","unstructured":"Aboluion N., Smith D.H., Perkins S.: Linear and nonlinear constructions of DNA codes with Hamming distance d, constant GC-content and a reverse-complement constraint. Discrete Math. 312, 1062\u20131075 (2012).","journal-title":"Discrete Math."},{"key":"1067_CR2","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. Franklin Inst. 343, 448\u2013457 (2006).","journal-title":"J. Franklin Inst."},{"key":"1067_CR3","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 the solutions to combinatorial problems. Science 266, 1021\u20131024 (1994).","journal-title":"Science"},{"key":"1067_CR4","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 P.W.K., Rowies S., Winfree E.: On applying molecular computation to the data encryption standard. J. Comput. Biol. 6, 53\u201363 (1999).","journal-title":"J. Comput. Biol."},{"key":"1067_CR5","unstructured":"Boneh, D., Dunworth, C., Lipton, R.: Breaking DES using molecular computer. Princenton CS Tech-Report, Number CS\u2013TR\u2013489\u201395 (1995)"},{"key":"1067_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24, 235\u2013265 (1997).","journal-title":"J. Symbolic Comput."},{"key":"1067_CR7","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.procs.2016.05.398","volume":"80","author":"M Blawat","year":"2016","unstructured":"Blawat M., et al.: Forward error correction for DNA data storage. Procedia Comput. Sci. 80, 1011\u20131022 (2016).","journal-title":"Procedia Comput. Sci."},{"key":"1067_CR8","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2021056","author":"Y Cengellenmis","year":"2021","unstructured":"Cengellenmis Y., Dertli A., Dougherty S.T., Korban A., Sahinkaya S., Ustun D.: Reversible $$G$$-codes over the ring $${\\cal{F}}_{j, k}$$ with applications to DNA codes. Adv. Math. Commun. (2021). https:\/\/doi.org\/10.3934\/amc.2021056.","journal-title":"Adv. Math. Commun."},{"key":"1067_CR9","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1126\/science.1226355","volume":"337","author":"GM Church","year":"2012","unstructured":"Church G.M., Gao Y., Kossuri S.: Next-generation digital information storage in DNA. Science 337, 1628 (2012).","journal-title":"Science"},{"key":"1067_CR10","doi-asserted-by":"publisher","first-page":"2115","DOI":"10.1007\/s10623-017-0440-7","volume":"86","author":"ST Dougherty","year":"2018","unstructured":"Dougherty S.T., Gildea J., Taylor R., Tylshchak A.: Group rings, $$G$$-codes and constructions of self-dual and formally self-dual codes. Des. Codes Crypt. 86, 2115\u20132138 (2018).","journal-title":"Des. Codes Crypt."},{"key":"1067_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-021-00504-9","author":"ST Dougherty","year":"2021","unstructured":"Dougherty S.T., Korban A., Sahinkaya S., Ustun D.: \"Group Matrix Ring Codes and Constructions of Self-Dual Codes \", Applicable Algebra in Engineering. Commun. Comput. (2021). https:\/\/doi.org\/10.1007\/s00200-021-00504-9.","journal-title":"Commun. Comput."},{"key":"1067_CR12","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."},{"issue":"3","key":"1067_CR13","first-page":"319","volume":"31","author":"T Hurley","year":"2006","unstructured":"Hurley T.: Group rings and rings of matrices. Int. J. Pure Appl. Math 31(3), 319\u2013335 (2006).","journal-title":"Int. J. Pure Appl. Math"},{"key":"1067_CR14","doi-asserted-by":"publisher","first-page":"112159","DOI":"10.1016\/j.disc.2020.112159","volume":"344","author":"HJ Kim","year":"2021","unstructured":"Kim H.J., Choi W.-H., Lee Y.: Designing DNA codes from reversible self-dual codes over $$GF(4)$$. Discrete Math. 344, 112159 (2021).","journal-title":"Discrete Math."},{"key":"1067_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.37236\/1726","volume":"10","author":"OD King","year":"2003","unstructured":"King O.D.: Bounds for DNA codes with constant GC-content. Electron. J. Comb. 10, 33 (2003).","journal-title":"Electron. J. Comb."},{"key":"1067_CR16","unstructured":"Korban A., Sahinkaya S., Ustun D.: Generator Matrices for the manuscript entitled \u201cReversible $$G^k$$-Codes with Applications to DNA Codes\u201d. https:\/\/sites.google.com\/view\/adriankorban\/generator-matrices."},{"key":"1067_CR17","unstructured":"Korban A., Sahinkaya S., Ustun D.: The source code of Magma for the DNA codes from Table\u00a01 for the manuscript entitled \u201cReversible $$G^k$$-Codes with Applications to DNA Codes. https:\/\/github.com\/DnzUstn\/Reversible-G-k--CodesWithApplicationsToDNACodes"},{"key":"1067_CR18","unstructured":"Korban A., Sahinkaya S., Ustun D.: An Application of the Virus Optimization Algorithm to the Problem of Finding Extremal Binary Self-Dual Codes. arXiv:2103.07739v1"},{"key":"1067_CR19","doi-asserted-by":"publisher","unstructured":"Limbachiya D., Benerjee K.G., Rao B., Gupta M.K.: On DNA Codes using the Ring Z4 + wZ4. In: 2018 IEEE International Symposium on Information Theory (ISIT), pp. 2401\u20132405, https:\/\/doi.org\/10.1109\/ISIT.2018.8437313 (2018)","DOI":"10.1109\/ISIT.2018.8437313"},{"key":"1067_CR20","unstructured":"Limbachiya D., Rao B., Gupta M.K.: \u201cThe art of DNA strings\u201d, Sixteen years of DNA coding theory, CoRR, vol. abs\/1607.00266 [Online] arXiv:1607.00266 (2016)"},{"key":"1067_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1089\/10665270152530818","volume":"8","author":"A Marathe","year":"2001","unstructured":"Marathe A., Condon A.E., Corn R.M.: On combinatorial DNA word design. J. Comput. Biol. 8, 201\u2013220 (2001).","journal-title":"J. Comput. Biol."},{"key":"1067_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ffa.2017.04.001","volume":"46","author":"ES Oztas","year":"2017","unstructured":"Oztas E.S., Yildiz B., Siap I.: A novel approach for constructing reversible codes and applications to DNA codes over the ring $$\\mathbb{F}_2[u]\/(u^{2k}-1)$$. Finite Fields Appl. 46, 217\u2013234 (2017).","journal-title":"Finite Fields Appl."},{"key":"1067_CR23","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/TCBB.2014.2299815","volume":"11","author":"D Tulpan","year":"2014","unstructured":"Tulpan D., Smith D.H., Montemanni R.: Thermodynamic post-processing versus GC-content pre-processing for DNA codes satisfying the Hamming distance and reverse-complement constraints. IEEE\/ACM Trans. Comput. Biol. Bioinform. 11, 441\u2013452 (2014).","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01067-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01067-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01067-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T15:18:16Z","timestamp":1657293496000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01067-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,24]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1067"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01067-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,24]]},"assertion":[{"value":"3 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}