LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

On the Skew Cyclic Codes and the Reversibility Problem for DNA 4-Bases

Photo from wikipedia

The DNA 4-bases are matched with the 256 elements of the finite ring $$R=F_{4}+uF_{4}+vF_{4}+uvF_{4}$$ R = F 4 + u F 4 + v F 4 + u v F… Click to show full abstract

The DNA 4-bases are matched with the 256 elements of the finite ring $$R=F_{4}+uF_{4}+vF_{4}+uvF_{4}$$ R = F 4 + u F 4 + v F 4 + u v F 4 , where $$ u^{2}=u,v^{2}=v,uv=vu$$ u 2 = u , v 2 = v , u v = v u . By defining a non trivial automorphism over R, the skew cyclic codes over the finite ring R are introduced. The reversible DNA codes are obtained, by using the skew cyclic codes whose generator polynomials satisfy some conditions. Thanks to this, the reversibility problem for DNA 4-bases can be solved. Moreover, the Gray images of the skew cyclic codes over the finite ring are determined.

Keywords: reversibility problem; cyclic codes; problem dna; skew cyclic; dna bases

Journal Title: Mathematics in Computer Science
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.