On Duplication-Free Codes for Disjoint or Equal-Length Errors
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929204669448192 |
|---|---|
| author | Yu, Wenjun Schwartz, Moshe |
| author_facet | Yu, Wenjun Schwartz, Moshe |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_04675 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On Duplication-Free Codes for Disjoint or Equal-Length Errors Yu, Wenjun Schwartz, Moshe Information Theory Combinatorics 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. |
| title | On Duplication-Free Codes for Disjoint or Equal-Length Errors |
| topic | Information Theory Combinatorics |
| url | https://arxiv.org/abs/2401.04675 |