The aim of this paper is to study DNA codes using some Gray images of codes over the chain rings S = F4t [u]<uk > and R = F4[v]⁄<vtk>. The special cases t=1 and k=2,3 were studied before. We construct some nice Gray maps from R, S to DNA codewords, whose images satisfy complement and reversibility properties. Studying the general case allows us to construct codes with better parameters. Subsequently, we concentrate on codes over arbitrary commutative rings and cyclic codes over R and obtain some necessary and sufficient conditions equal to the common constraints on DNA codes, like reversibility. Moreover, a variety of sample codes over multiple rings are presented.
MSC Classification: 11T71 , 94B05 , 94B15