A Special Class of Additive Cyclic Codes for DNA Computing

In this paper, we study a special class of nonbinary additive cyclic codes over GF(4) which we call reversible complement cyclic codes. Such codes are suitable for constructing codewords for DNA computing. We develop the theory behind constructing the set of generator polynomials for these codes. We study, as an example, all length—7 codes over GF(4) and list those that have the largest minimum Hamming distance and largest number of codewords.