Bounds for DNA codes with constant GC-content
Combinatorics
2007-05-23 v2 Biomolecules
Abstract
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.
Keywords
Cite
@article{arxiv.math/0306197,
title = {Bounds for DNA codes with constant GC-content},
author = {Oliver D. King},
journal= {arXiv preprint arXiv:math/0306197},
year = {2007}
}
Comments
13 pages, no figures; a few references added and typos corrected