Bounds for DNA codes with constant GC-content
The electronic journal of combinatorics, Tome 10 (2003)
We derive theoretical upper and lower bounds on the maximum size of DNA codes of length $n$ with constant GC-content $w$ and minimum Hamming distance $d$, both with and without the additional constraint that the minimum Hamming distance between any codeword and the reverse-complement of any codeword be at least $d$. We also explicitly construct codes that are larger than the best previously-published codes for many choices of the parameters $n$, $d$ and $w$.
@article{10_37236_1726,
author = {Oliver D. King},
title = {Bounds for {DNA} codes with constant {GC-content}},
journal = {The electronic journal of combinatorics},
year = {2003},
volume = {10},
doi = {10.37236/1726},
zbl = {1030.94049},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1726/}
}
Oliver D. King. Bounds for DNA codes with constant GC-content. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1726
Cité par Sources :