Abstract
DNA has a complicated structure with an excellent error correcting capability. Recently, some codes with similar properties as DNA are studied. Cyclic codes of even lengths over \({\mathbb {F}}_2+u{\mathbb {F}}_2\) satisfy the reverse constraint and the reverse-complement constraint are studied in this paper. The existence and the structure of such codes are completely answered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abualrub, T., Siap, I.: On the construction of cyclic codes over the ring \(Z_2+uZ_2\). In: Proceedings, the 9th WSEAS International Conference on Applied Mathematics, pp. 430–435. Istanbul, Turkey (2006)
Abualrub, T., Siap, I.: Cyclic codes over the rings \(Z_{2}+uZ_{2}\) and \(Z_{2}+uZ_{2}+u^{2}Z_{2}\). Des. Codes Cryptogr. 42, 273–287 (2007)
Abualrub, T., Ghrayeb, A., Zeng, X.: Construction of cyclic codes over \(GF(4)\) for DNA computing. J. Frankl. Inst. 343(4–5), 448–457 (2006)
Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Adleman, L., Rothemund, P.W.K., Roweis, S., Winfree, E.: On applying molecular computation to the data encryption standard. J. Comput. Biol. 6, 53–63 (1999)
Boneh, D., Dunworth, C., Lipton, R.: Breaking DES Using Molecular Computer. Princeton CS Tech-Report, Number CS-TR-489-95 (1995)
Bonnecaze, A., Udaya, P.: Cyclic codes and self-dual codes over \({\mathbb{F}}_2+u{\mathbb{F}}_2\). IEEE Trans. Inf. Theory 45, 1250–1254 (1999)
Frutos, A.G., Liu, Q., Thiel, A.J., et al.: Demonstration of a word design strategy for DNA computing on surfaces. Nucl. Acids Res. 25, 4748–4757 (1997)
Gaborit, P., King, O.D.: Linear construction for DNA codes. Theor. Comput. Sci. 334(1–3), 99–113 (2005)
Guenda, K., Aaron Gulliver, T.: Construction of cyclic codes over \({\mathbb{F}}_2+u{\mathbb{F}}_2\) for DNA computing. AAECC 24(6), 445–459 (2013)
King, O.D.: Bounds for DNA codes with constant GC-content. Electron. J. Comb. 10, 1–13 (2003)
Liebovitch, L.S., Tao, Y., Todorov, A.T., Levine, L.: Is there an error correcting code in the base sequence in DNA? Biophys. J. 71, 1539–1544 (1996)
Lipton, R.J.: DNA solution of hard computational problems. Science 268, 542–545 (1995)
Mansuripur, M., Khulbe, P.K., Kuebler, S.M. et al.: Information storage and retrieval using macromolecules as storage media. University of Arizona Technical Report (2003)
Marathe, A., Condon, A.E., Corn, R.M.: On combinatorial DNA word design. J. Comput. Biol. 8, 201–220 (2001)
Massey, J.L.: Reversible codes. Inf. Control 7(3), 369–380 (1964)
Siap, I., Abualrub, T., Ghrayeb, A.: Cyclic DNA codes over the ring \({\mathbb{F}}_2[u]/(u^2-1)\) based on the deletion distance. J. Frankl. Inst. 346, 731–740 (2009)
Udaya, P., Bonnecaze, A.: Decoding of cyclic codes over \({\mathbb{F}}_2+u{\mathbb{F}}_2\). IEEE Trans. Inf. Theory 45, 2148–2157 (1999)
Yildiz, B., Siap, I.: Cyclic DNA codes over the ring \({\mathbb{F}}_2[u]/(u^4-1)\) and applications to DNA codes. Comput. Math. Appl. 63(7), 1169–1176 (2012)
Acknowledgments
We are indebted to the anonymous referees for constructive comments on our manuscript. The work of Liqi Wang was partially supported by the National Natural Science Foundation of China under Grant No. 61370089.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liang, J., Wang, L. On cyclic DNA codes over \({\mathbb {F}}_2+u{\mathbb {F}}_2\) . J. Appl. Math. Comput. 51, 81–91 (2016). https://doi.org/10.1007/s12190-015-0892-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-015-0892-8