On Duplication-Free Codes for Disjoint or Equal-Length Errors

Author:

Wenjun Yu, Moshe Schwartz

Keyword:

Computer Science, Information Theory, Information Theory (cs.IT), Combinatorics (math.CO)

journal:

date:

2024-01-09 00:00:00

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.

PDF: On Duplication-Free Codes for Disjoint or Equal-Length Errors.pdf