In this article, we investigate the algebraic structure of double cyclic codes of length over with and construct DNA codes from these codes. The theory of constructing double cyclic codes suitable for DNA codes is studied. We provide the necessary and sufficient conditions for the double cyclic codes to be reversible and reversible-complement codes. As an illustration, we present some of the DNA codes generated from our results.
Get full access to this article
View all access options for this article.
References
1.
AbualrubT, SiapI. Cyclic codes over the rings and . Des Codes Cryptogr, 2007; 42(3):273–287.
2.
AbualrubT, GhrayebA, ZengXN. Construction of cyclic codes over for DNA computing. J Franklin Inst, 2006; 343:448–457.
3.
AdlemanLM.Molecular computation of solutions to combinatorial problems. Science, 1994; 2660 (5187):0 1021–10244.
4.
AdlemanLM, RothemundPWK, RoweisST, et al.On applying molecular computation to the data encryption standard. J Comput Biol, 1999; 6:53–63.
5.
AydogduI, AbualrubT, SameiK. -double cyclic codes with respect to the hermitian inner product. Appl Algebra Eng Commun Comput. 2022:1–16.
6.
BayramA, OztasES, SiapI. Codes over and some DNA applications. Des Codes Cryptogr, 2016; 80:379–393.
7.
BenensonY, GilB, Ben-DorU, et al.An autonomous molecular computer for logical control of gene expression. Nature, 2004; 429:423–429.
8.
BonehD, DunworthC, LiptonRJ. Breaking DES using a molecular computer. In: DNA Based Computers. 1995; 27:37–66.
DengT, YangJ. Double cyclic codes over . Mathematics, 2020; 8:1820.
11.
DinhHQ, PathakS, BagT, et al. A study of -cyclic codes and their applications in constructing quantum codes. IEEE Access 2020a;8:190049–190063.
12.
DinhHQ, PathakS, BagT, et al.On -cyclic codes and their applications in constructing optimal codes. Discrete Math, 2021a;344(5):112310.
13.
DinhHQ, PathakS, BagT, et al. Constacyclic codes over mixed alphabets and their applications in constructing new quantum codes. Quantum Inf Process 2021b;20:1–35.
14.
DinhHQ, SinghAK, PattanayakS, et al. DNA cyclic codes over the ring . Int J Biomath 2018a;11:1–19.
15.
DinhHQ, SinghAK, PattanayakS, et al. Cyclic DNA codes over the ring . Des Codes Cryptogr 2018b;86:1451–1467.
16.
DinhHQ, SinghAK, PattanayakS, et al.Construction of cyclic DNA codes over the ring based on the deletion distance. Theor Comput Sci, 2019; 773:27–42.
17.
DinhHQ, PathakS, UpadhyayAK, et al.New DNA codes from cyclic codes over mixed alphabets. Mathematics, 2020b;8:1977.
18.
GaboritP, KingOD. Linear constructions for DNA codes. Theor Comput Sci, 2005; 334:99–113.
19.
GaoJ, HouX. -double cyclic codes are asymptotically good. IEEE Commun Lett, 2020; 24:1593–1597.
20.
GaoJ, ShiM, WuT, et al.On double cyclic codes over . Finite Fields Appl, 2016; 39:233–250.
21.
GuendaK, GulliverTA. Construction of cyclic codes over for DNA computing. Appl Algebra Eng Commun Comput, 2013; 24:445–459.
22.
KariL, GloorGB, YuS. Using DNA to solve the bounded post correspondence problem. Theor Comput Sci, 2000; 231:193–203.
23.
LiangJ, WangL. On cyclic DNA codes over . J Appl Math Comput, 2016; 51:81–91.
24.
LiptonRJ.DNA solution of hard computational problems. Science, 1995; 268(5210):542–545.
25.
LiuJ, LiuH. DNA codes over the ring . IEEE Access 2020a;8:77528–77534.
26.
LiuJ, LiuH. Construction of cyclic DNA codes over the ring . IEEE Access 2020b;8:111200–111207.
27.
MaratheA, CondonA, CornRM. On combinatorial DNA word design. J Comput Biol, 2001; 8:201–219.
28.
McDonaldB. Finite rings with identity. M. Dekker, New YorkNY. 1974. ISBN 9780824761615.
29.
SiapI, KulhanN. The structure of generalized quasi cyclic codes. Appl Math E-Notes, 2005; 5:24–30.
30.
SiapI, AbualrubT, GhrayebA. Cyclic DNA codes over the ring based on the deletion distance. J Franklin Inst, 2009; 346:731–740.
31.
YaoT, ShiM, SoléP. Double cyclic codes over . Int J Inf Coding Theory, 2015; 3:145–157.
32.
YildizB, SiapI. Cyclic DNA codes over the ring and applications to DNA codes. Comput Math Appl, 2012; 63:1169–1176.
33.
ZhuS, ChenX. Cyclic DNA codes over and their applications. J Appl Math Comput, 2017; 55:479–493.
