Affiliation:
1. Research Group of Algebraic Structures and Applications, Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia
2. Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar 382007, India
Abstract
DNA code design is a challenging problem, and it has received great attention in the literature due to its applications in DNA data storage, DNA origami, and DNA computing. The primary focus of this paper is in constructing new DNA codes using the cosets of linear codes over the ring Z4. The Hamming distance constraint, GC-content constraint, and homopolymers constraint are all considered. In this study, we consider the cosets of Simplex alpha code, Kerdock code, Preparata code, and Hadamard code. New DNA codes of lengths four, eight, sixteen, and thirty-two are constructed using a combination of an algebraic coding approach and a variable neighborhood search approach. In addition, good lower bounds for DNA codes that satisfy important constraints have been successfully established using Magma software V2.24-4 and Python 3.10 programming in our comprehensive methodology.
Funder
Deanship of Scientific Research (DSR), King Abdulaziz University
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference19 articles.
1. Molecular computation of solutions to combinatorial problems;Adleman;Science,1994
2. Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content;Smith;Discret. Math.,2011
3. Encoded combinatorial chemistry;Brenner;Proc. Natl. Acad. Sci. USA,1992
4. Limbachiya, D., Rao, B., and Gupta, M.K. (2016). The art of DNA strings: Sixteen years of DNA coding theory. arXiv.
5. On conflict free DNA codes;Benerjee;Cryptogr. Commun.,2021