Abstract
We develop the theory for constructing DNA cyclic codes of odd length over R=Z4[u]/〈u2−1〉 based on the deletion distance. Cyclic codes of odd length over R satisfying the reverse constraint and the reverse-complement constraint are discussed. The GC-content of these codes and their deletion distance are studied. Among others, examples of cyclic DNA codes with GC-content and their respective deletion distance are provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
