Greedy Construction of DNA Codes and New Bounds
classification
💻 cs.IT
math.IT
keywords
codesboundscontentgreedymathbbalgorithmboundedconstant
read the original abstract
In this paper, we construct linear codes over $\mathbb{Z}_4$ with bounded $GC$-content. The codes are obtained using a greedy algorithm over $\mathbb{Z}_4$. Further, upper and lower bounds are derived for the maximum size of DNA codes of length $n$ with constant $GC$-content $w$ and edit distance $d$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.