On a generalization of lifted polynomials over finite fields and their applications to DNA codesFootnote

^†The preliminary results of this paper are presented in Proceedings of the 2013 International Conference on Computational and Mathematical Methods in Science and Engineering – CMMSE 2013, p. 1133, 24–27 June 2013, Almeria, Spain.

References

• N. Aboluion, D.H. Smith, and S. Perkins, Linear and nonlinear constructions of DNA codes with Hamming distance d, constant GC-content and a reverse-complement constraint, Discrete Math. 312 (2012), pp. 1062–1075. doi: 10.1016/j.disc.2011.11.021
   Web of Science ®Google Scholar
• T. Abualrub, A. Ghrayeb, and X.N. Zeng, Consruction of cyclic codes over F4 for DNA computing, J. Franklin Inst. 343 (2006), pp. 448–457. doi: 10.1016/j.jfranklin.2006.02.009
   Web of Science ®Google Scholar
• L. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (1994), pp. 1021–1024. doi: 10.1126/science.7973651
   PubMed Web of Science ®Google Scholar
• P.K. Das and V. Tyagi, Reversible and (n1, n2)-blockwise reversible code, Internat. J. Algebra Comput. 6(4) (2012), pp. 185–191.
   Google Scholar
• R. Deaton, M. Garzon, R.C. Murphy, D.R. Franceschetti, S.E. Stevens, Genetic search of reliable encoding for DNA based computation, First Conference on Genetic Programming GP-96, Stanford University, 1996, pp. 9–15.
   Google Scholar
• R. Deaton, R.E. Murphy, J.A. Rose, M. Garzon, D.R. Franceschetti, and S.E. StevensJr., A DNA based implementation of an evolutionary search for good encodings for DNA computation, IEEE International Conference on Evolutionary Computation 1997, 13–16 April, 1997, pp. 267–272.
   Google Scholar
• A. Dyachkov, P. Erdos, A. Macula, D. Torney, C.H. Tung, P. Vilenkin, and P.S. White, Exordium for DNA codes, J. Comb. Optim. 7 (2003), pp. 369–379. doi: 10.1023/B:JOCO.0000017385.39168.0d
   Web of Science ®Google Scholar
• A. Dyachkov, A. Macula, T. Renz, P. Vilenkin, and I. Ismagilov, New results on DNA codes, International Symposium on Information Theory (ISIT 2005), September 2005, pp. 283–287.
   Google Scholar
• A.G. Frugtos, 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 (1997), pp. 4748–4757. doi: 10.1093/nar/25.23.4748
   PubMed Web of Science ®Google Scholar
• P. Gaborit and O.D. King, Linear construction for DNA codes, Theoret. Comput. Sci. 334(1–3) (2005), pp. 99–113. doi: 10.1016/j.tcs.2004.11.004
   Web of Science ®Google Scholar
• M. Grassl, Bounds on the minimum distance of linear codes and quantum codes. Available at http://www.codetables.de (accessed 20 October 2012).
   Google Scholar
• O. King, Bounds for DNA codes with constant GC-content, J. Combin. 10 (2003), pp. 1–13.
   Web of Science ®Google Scholar
• 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 microarrays, Langmuir 18 (2002), pp. 805–812. doi: 10.1021/la0112209
   Web of Science ®Google Scholar
• M. Mansuripur, P.K. Khulbe, S.M. Kuebler, J.W. Perry, M.S. Giridhar, and N. Peyghambarian, Information storage and retrieval using macromolecules as storage media, Optical Data Storage – OSA Technical Digest Series (Optical Society of America), 2003.
   Google Scholar
• A. Marathe, A.E. Condon, and R.M. Corn, On combinatorial DNA word design, J. Comput. Biol. 8 (2001), pp. 201–220. doi: 10.1089/10665270152530818
   PubMed Web of Science ®Google Scholar
• J.L. Massey, Reversible codes, Inf. Control 7 (1964), pp. 369–380. doi: 10.1016/S0019-9958(64)90438-3
   Google Scholar
• S.K. Muttoo and S. Lal, A reversible code over GF(q), Kybernetika 22(N. 1) (1986), pp. 85–91.
   Web of Science ®Google Scholar
• E.S. Oztas, I. Siap, Lifted polynomials over F16 and their applications to DNA codes, Filomat 27(3) (2013), pp. 459–466. doi: 10.2298/FIL1303459O
   Web of Science ®Google Scholar
• V. Rykov, A.J. Macula, D. Torney, and P. White, DNA sequences and quaternary cyclic codes, IEEE International Symposium on Information Theory (ISIT 2001), Washington, DC, 2001, p. 248.
   Google Scholar
• I. Siap, T. Abualrub, and A. Ghrayeb, Cyclic DNA codes over the ring F2[u]/(u2−1) based on the deletion distance, J. Franklin Inst. 346 (2006), pp. 731–740.
   Google Scholar
• D.C. Tuplan, H. Hoos, and A. Condon, Stochastic local search algorithms for DNA word design, Lecture Notes in Computer Science, Springer, Berlin, 2003, pp. 229–241.
   Google Scholar
• B. Yildiz and I. Siap, Cyclic codes over F2[u]/(u4−1) and applications to DNA codes, Comput. Math. Appl. 63 (2012), pp. 1169–1176. doi: 10.1016/j.camwa.2011.12.029
   Web of Science ®Google Scholar