Reversible G^k-Codes with Applications to DNA Codes

DOI10.1007/S10623-022-01067-7MaRDI QIDQ6374493arXivWikidataFDO

Authors Adrian Korban, Serap Şahinkaya, Deniz Ustun

Publication date 4 August 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10623-022-01067-7

Mathematics Subject Classification ID

Group rings (16S34) Linear codes (general theory) (94B05)

arXiv classification

cs.ITmath.IT

Abstract: In this paper, we give a matrix construction method for designing DNA codes that come from group matrix rings. We show that with our construction one can obtain reversible $G^k$-codes of length $kn,$ where $k,ninmathbbN,$ over the finite commutative Frobenius ring $R.$ We employ our construction method to obtain many DNA codes over $mathbb{F}_4$ that satisfy the Hamming distance, reverse, reverse-complement and the fixed GC-content constraints. Moreover, we improve many lower bounds on the sizes of some known DNA codes and we also give new lower bounds on the sizes of some DNA codes of lengths $48,56,60,64$ and $72$ for some fixed values of the Hamming distance $d.$

This page was built for publication: Reversible $G^k$-Codes with Applications to DNA Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6374493)