In this paper, we give a matrix construction method for designing DNA codes that come from group rings. We show with our one can obtain reversible $$G^k$$ -codes of length kn, where $$k, n \in \mathbb {N},$$ over the finite commutative Frobenius ring R. employ to many $$\mathbb {F}_4$$ satisfy Hamming distance, reverse, reverse-complement and fixed GC-content constraints. Moreover, improve lowe...