Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

DNA Codes over the Ring $\mathbb{Z}_4 + w\mathbb{Z}_4$ (2110.09089v1)

Published 18 Oct 2021 in cs.IT, cs.ET, math.IT, and math.RA

Abstract: In this present work, we generalize the study of construction of DNA codes over the rings $\mathcal{R}\theta=\mathbb{Z}_4+w\mathbb{Z}_4$, $w2 = \theta $ for $\theta \in \mathbb{Z}_4+w\mathbb{Z}_4$. Rigorous study along with characterization of the ring structures is presented. We extend the Gau map and Gau distance, defined in \cite{DKBG}, over all the $16$ rings $\mathcal{R}\theta$. Furthermore, an isometry between the codes over the rings $\mathcal{R}\theta$ and the analogous DNA codes is established in general. Brief study of dual and self dual codes over the rings is given including the construction of special class of self dual codes that satisfy reverse and reverse-complement constraints. The technical contributions of this paper are twofold. Considering the Generalized Gau distance, Sphere Packing-like bound, GV-like bound, Singleton like bound and Plotkin-like bound are established over the rings $\mathcal{R}\theta$. In addition to this, optimal class of codes are provided with respect to Singleton-like bound and Plotkin-like bound. Moreover, the construction of family of DNA codes is proposed that satisfies reverse and reverse-complement constraints using the Reed-Muller type codes over the rings $\mathcal{R}_\theta$.

Citations (5)

Summary

We haven't generated a summary for this paper yet.