Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Reversible DNA codes over a family of non-chain rings $R_{k,s}$ (1711.02385v2)

Published 7 Nov 2017 in math.CO, cs.IT, and math.IT

Abstract: In this paper, we solve the reversibility problem for DNA codes over the non-chain ring $R_{k,s}=\mathbb{F}{4{2k}}[u_1,...,u{s}]/< u_12-u_1,..., u_s2-u_s>$. We define an automorphism $\theta$ over $R_{k,s}$ which help us both find the idempotent decomposition of $R_{k,s}$ and solve the reversibility problem via skew cyclic codes. Moreover, we introduce a generalized Gray map that preserves DNA reversibility.

Summary

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