  Motivated by applications in DNA storage, we study a setting in which strings
are affected by tandem-duplication errors. In particular, we look at two
settings: disjoint tandem-duplication errors, and equal-length
tandem-duplication errors. We construct codes, with positive asymptotic rate,
for the two settings, as well as for their combination. Our constructions are
duplication-free codes, comprising codewords that do not contain tandem
duplications of specific lengths. Additionally, our codes generalize previous
constructions, containing them as special cases.
