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 language | English |
---|---|
Pages (from-to) | 2845-2861 |
Number of pages | 17 |
Journal | Designs, Codes, and Cryptography |
Volume | 92 |
Issue number | 10 |
DOIs | |
State | Published - 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