On DNA codes from a family of chain rings
Keywords:
Cyclic codes, Chain rings, Reversible codes, DNA codesAbstract
In this work, we focus on reversible cyclic codes which correspond to reversible DNA codes or reversible-complement DNA codes over a family of finite chain rings, in an effort to extend what was done by Yildiz and Siap in [20]. The ring family that we have considered are of size $2^{2^k}$, $k=1,2, \cdots$ and we match each ring element with a DNA $2^{k-1}$-mer. We use the so-called $u^2$-adic digit system to solve the reversibility problem and we characterize cyclic codes that correspond to reversible-complement DNA-codes. We then conclude our study with some examples.
Downloads
References
N. Aboluion, D. H. Smith, and S. Perkins, Linear and nonlinear constructions of DNA codes with Hamming distance and GC–content constraints, Discrete Math. 312(6) (2012) 1062–1075.
T. Abualrub, A. Ghrayeb, and X. N. Zeng, Construction of cyclic codes over $\mathbb{Z}_4$ for DNA computing, J. Franklin Inst. 343(4–5) (2006) 448–457.
L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science 266(5187) (1994) 1021–1024.
L. M. Adleman, P. W. K. Rothemund, S. Roweis, and E. Winfree, On applying molecular computation to the Data Encryption Standard, J. Comput. Biol. 6(1) (1999) 53–63.
R. Alfaro, S. Bennett, J. Harvey, and C. Thornburg, On distances and self–dual codes over $\mathbb{F}_q[u]/(u^3)$, Involve 2(2) (2009) 177–187.
D. Boneh, C. Dunworth, and R. J. Lipton, Breaking DES using a molecular computer, in: R. J. Lipton and E. B. Baum (Eds.), DNA Based Computers, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 27, American Mathematical Society, Providence, RI, 1996, pp. 37–65.
A. G. Frutos, Q. Liu, A. J. Thiel, A. M. W. Sanner, A. E. Condon, L. M. Smith, and R. M. Corn, Demonstration of a word design strategy for DNA computing on surfaces, Nucleic Acids Res. 25(23) (1997) 4748–4757.
P. Gaborit and O. D. King, Linear constructions for DNA codes, Theoret. Comput. Sci. 334(1–3) (2005) 99–113.
O. D. King, Bounds for DNA codes with constant GC–content, Electron. J. Combin. 10(1) (2003) #R33.
M. Li, H. J. Lee, A. E. Condon, and R. M. Corn, DNA word design strategy for creating sets of non–interacting oligonucleotides for DNA computing, Langmuir 18(3) (2002) 805–812.
M. Mansuripur, P. K. Khulbe, S. M. Kuebler, J. W. Perry, M. S. Giridhar, N. Peyghambarian, and J. M. Caruthers, Information storage and retrieval using macromolecules as storage media, in: Optical Data Storage 2003, Technical Digest, Optica Publishing Group, 2003, paper TuC2.
A. Marathe, A. E. Condon, and R. M. Corn, On combinatorial DNA word design, J. Comput. Biol. 8(3) (2001) 201–219.
J. L. Massey, Reversible codes, Inform. and Control 7(3) (1964) 369–380.
G. H. Norton and A. Sălăgean, On the structure of linear and cyclic codes over a finite chain ring, Appl. Algebra Engrg. Comm. Comput. 10(6) (2000) 489–506.
E. S. Öztas and I. Siap, Lifted polynomials over $\mathbb{F}_{16}$ and their applications to DNA codes, Filomat 27(3) (2013) 459–466.
E. S. Öztas, I. Siap, and B. Yildiz, Reversible codes and applications to DNA, in: M. Bras-Amorós (Ed.), Algebraic Informatics, Lecture Notes in Computer Science, vol. 8494, Springer, Berlin, Heidelberg, 2014, pp. 248–259.
E. S. Öztas and I. Siap, On a generalization of lifted polynomials over finite fields and their applications to DNA codes, Int. J. Comput. Math. 92(9) (2015) 1976–1988.
I. Siap, T. Abualrub, and A. Ghrayeb, Similarity cyclic DNA codes over rings, in: 2nd International Conference on Bioinformatics and Biomedical Engineering (ICBBE 2008), IEEE, 2008, pp. 586–589.
I. Siap, T. Abualrub, and A. Ghrayeb, Cyclic DNA codes over the ring $\mathbb{F}_2[u]/(u^2-1)$ and applications to DNA computing, J. Franklin Inst. 346(8) (2009) 733–740.
B. Yildiz and I. Siap, Cyclic codes over $\mathbb{F}_2[u]/(u^4-1)$ and applications to DNA codes, Comput. Math. Appl. 63(7) (2012) 1169–1176.
