Bounds for DNA codes with constant GC-content

Simple item page
dc.creatorKing, Oliver D.
dc.date2003-06-12
dc.date2004-02-26
dc.date.accessioned2026-07-07T04:58:56Z
dc.date.available2026-07-07T04:58:56Z
dc.descriptionWe 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.
dc.description13 pages, no figures; a few references added and typos corrected
dc.identifierhttps://arxiv.org/abs/math/0306197
dc.identifierhttp://arxiv.org/abs/math/0306197
dc.identifierElectronic Journal of Combinatorics, vol. 10 (2003), R33, 13pp
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67780
dc.subjectCombinatorics
dc.subjectBiomolecules
dc.subject05B40
dc.titleBounds for DNA codes with constant GC-content
dc.typetext

Files

Collections

arXiv