Construction of (σ,δ)-cyclic codes over a non-chain ring and their applications in DNA codes
Abstract
For a prime p and a positive integer m, let Fpm be the finite field of characteristic p, and Rl:=Fpm[v]/ vl-v be a non-chain ring. In this paper, we study the (σ,δ)-cyclic codes over Rl. Further, we study the application of these codes in finding DNA codes. Towards this, we first define a Gray map to find classical codes over Fpm using codes over the ring Rl. Later, we find the conditions for a code to be reversible and a DNA code using (σ, δ)-cyclic code. Finally, this algebraic method provides many classical and DNA codes of better parameters.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.