On duplication-free codes for disjoint or equal-length errors

Wenjun Yu, Moshe Schwartz

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
JournalDesigns, Codes, and Cryptography
StateAccepted/In press - 1 Jan 2024


  • 68R15
  • 94B25
  • 94B35
  • Duplication-free words
  • Error-correcting codes
  • String-duplication systems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'On duplication-free codes for disjoint or equal-length errors'. Together they form a unique fingerprint.

Cite this