Reversible Codes and Its Application to Reversible DNA Codes over F_4^k

2018/06/12 by Lei Chen, Jin Li, Chen, Lei +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced biosensing and bioanalysis techniques #Cellular Automata and Applications #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1806.04367

openalex publication_date 2018/06/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Coterm polynomials are introduced by Oztas et al. [a novel approach for constructing reversible codes and applications to DNA codes over the ring F₂[u]/(u^2k-1), Finite Fields and Their Applications 46 (2017).pp. 217-234.], which generate reversible codes. In this paper, we generalize the coterm polynomials and construct some reversible codes which are optimal codes by using m-quasi-reciprocal polynomials. Moreover, we give a map from DNA k-bases to the elements of F_4^k, and construct reversible DNA codes over F_4^k by DNA-m-quasi-reciprocal polynomials.

Related

• Reversible DNA codes over a family of non-chain rings R_k,s
• Reversible DNA codes over F₁₆+uF₁₆+vF₁₆+uvF₁₆
• Reversible DNA Codes Using Skew Polynomial Rings
• On reversible and reversible-complementary DNA codes over \mathbbF₄
• Reversible G^k-Codes with Applications to DNA Codes