We also explicitly construct codes that are larger than the best previously-published codes for many choices of the parameters n, d and w.doi:10.37236/1726Oliver D. KingCiteSeerThe electronic journal of combina
Bounds for DNA codes with constant GC-content - King - 2003 () Citation Context ...large enough d) [10]. We will not consider this constraint in this work. Though, it is possible to derive bounds for the case considering this constraint from the simpler case without this constraint =-=...
GC-contentEdit distanceUpper and lower boundsIn this paper, we construct linear codes over Z4 with bounded GC-content. The codes are obtained using a greedy algorithm over Z4. Further, upper and lower bounds are derived for the maximum size DNA codes of length n with constant GC-content w...