Abstract
In this paper, we develop a theory for constructing cyclic codes of odd length over the ring [Formula: see text], where [Formula: see text], which plays an important role in DNA computing. A direct link between the elements of [Formula: see text] and the [Formula: see text] codons used in the amino acids of the living organisms is established. Then, we investigate reversible cyclic codes and reversible complement cyclic codes of odd length over [Formula: see text]. Moreover, we give some properties of binary images of the codons under the Gray map. Finally, two examples of cyclic codes over [Formula: see text] with their minimum Hamming distance will be studied as well.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.