On Double Cyclic Codes over Finite Chain Rings for DNA Computing

关于有限链环上的双循环码在DNA计算中的应用

阅读:1

Abstract

Let e be a fixed positive integer and n1,n2 be odd positive integers. The main objective of this article is to investigate the algebraic structure of double cyclic codes of length (n1,n2) over the finite chain ring Re = F4e+vF4e, where v2=0. Building upon this structural framework, we further demonstrate the construction of DNA codes derived from these double cyclic codes over Re. In addition, we provide the necessary and sufficient criteria showing that these codes possess reversibility and reverse-complement properties over Re. Furthermore, we introduce a generalized Gray map that extends the classical Gray map from the ring F2+vF2 with v2=0 to the ring Re, showing a direct correspondence between elements of Re and DNA sequences over S={A,T,G,C} utilizing double cyclic codes. To illustrate the applicability of our results, we present some examples demonstrating the effectiveness of the mapping in generating reversible and reverse-complement DNA codes from algebraic structures over the ring Re.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。