Abstract
In this paper, we develop the theory for constructing linear and additive cyclic codes of odd length over GF ( 4 ) that are suitable for DNA computing. We call this class of codes reversible complement cyclic codes. We use this theory to study all such codes of lengths 7 , 9 , 11 and 13 . We list the codes that have the largest number of codewords for a given minimum Hamming distance. We show that some of these codes have more codewords than previously known codes with the same minimum Hamming distance.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
