Reversible DNA codes over a family of non-chain rings Rk,s

Abstract

In this paper, we solve the reversibility problem for DNA codes over the non-chain ring Rk,s=F42k[u1,...,us]/< u12-u1,..., us2-us>. We define an automorphism θ over Rk,s which help us both find the idempotent decomposition of Rk,s and solve the reversibility problem via skew cyclic codes. Moreover, we introduce a generalized Gray map that preserves DNA reversibility.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…