Construction of cyclic codes over F2 + uF2 for DNA computing

Abstract

We construct codes over the ring F2 + uF2 with u 2 = 0 for use in DNA computing applications. The codes obtained satisfy the reverse complement constraint, the GC content constraint, and avoid the secondary structure. They are derived from cyclic reverse-complement codes over the ring F2 + uF2. We also construct an infinite family of BCH DNA codes.