On the Coding Capacity of Reverse-Complement and Palindromic Duplication-Correcting Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929248494682112 |
|---|---|
| author | Yohananov, Lev Schwartz, Moshe |
| author_facet | Yohananov, Lev Schwartz, Moshe |
| contents | We derive the coding capacity for duplication-correcting codes capable of correcting any number of duplications. We do so both for reverse-complement duplications, as well as palindromic (reverse) duplications. We show that except for duplication-length $1$, the coding capacity is $0$. When the duplication length is $1$, the coding capacity depends on the alphabet size, and we construct optimal codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_00394 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On the Coding Capacity of Reverse-Complement and Palindromic Duplication-Correcting Codes Yohananov, Lev Schwartz, Moshe Information Theory We derive the coding capacity for duplication-correcting codes capable of correcting any number of duplications. We do so both for reverse-complement duplications, as well as palindromic (reverse) duplications. We show that except for duplication-length $1$, the coding capacity is $0$. When the duplication length is $1$, the coding capacity depends on the alphabet size, and we construct optimal codes. |
| title | On the Coding Capacity of Reverse-Complement and Palindromic Duplication-Correcting Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2312.00394 |