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

Wenjun Yu, Moshe Schwartz

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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
Pages (from-to)2845-2861
Number of pages17
JournalDesigns, Codes, and Cryptography
Volume92
Issue number10
DOIs
StatePublished - 1 Oct 2024

Keywords

  • 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

Fingerprint

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

Cite this