  DNA codes have many applications, such as in data storage, DNA computing,
etc. Good DNA codes have large sizes and satisfy some certain constraints. In
this paper, we present a new construction method for reversible DNA codes. We
show that the DNA codes obtained using our construction method can satisfy some
desired constraints and the lower bounds of the sizes of some DNA codes are
better than the known results. We also give new lower bounds on the sizes of
some DNA codes of lengths $80$, $96$ and $160$ for some fixed Hamming distance
$d$.
