On Duplication-Free Codes for Disjoint or Equal-Length Errors
Information Theory
2024-01-10 v1 Combinatorics
math.IT
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.
Cite
@article{arxiv.2401.04675,
title = {On Duplication-Free Codes for Disjoint or Equal-Length Errors},
author = {Wenjun Yu and Moshe Schwartz},
journal= {arXiv preprint arXiv:2401.04675},
year = {2024}
}