Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 3283-3302 |
| Number of pages | 20 |
| Journal | Designs, Codes, and Cryptography |
| Volume | 93 |
| Issue number | 8 |
| DOIs | |
| State | Published - 1 Aug 2025 |
Keywords
- Coding capacity
- Error-correcting codes
- Palindromic duplication
- Reverse-complement duplication
- String-duplication systems
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'On the coding capacity of reverse-complement and palindromic duplication-correcting codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver