Reversible cyclic codes over F4 + uF4 and their applications to DNA codes

B. Srinivasulu, Maheshanand Bhaintwal

2015 · 10 citations · 14 references

Concepts

Abstract

In this paper we study the structure of reversible cyclic codes of both even and odd lengths over the ring R = F <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sub> + uF <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sub> , u <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> = 0. We present necessary and sufficient conditions for a cyclic code over R to be reversible-complement. We also study cyclic DNA codes over nucleotide base pairs S(D <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">16</sub> ), where S(D <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">16</sub> ) = {GG, GA, GC, GT, CC, CA, CG, CT, AA, AT, AG, AC, TT, TA, TG, TC}. For this we first establish a one-to-one correspondence between R and S(D <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">16</sub> ), and then cyclic DNA codes are constructed over S(D <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">16</sub> ) as the images of reversible-complement cyclic codes over R.

References

14