On the Coding Capacity of Reverse-Complement and Palindromic Duplication-Correcting Codes
Information Theory
2024-02-21 v2 math.IT
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 , the coding capacity is . When the duplication length is , the coding capacity depends on the alphabet size, and we construct optimal codes.
Keywords
Cite
@article{arxiv.2312.00394,
title = {On the Coding Capacity of Reverse-Complement and Palindromic Duplication-Correcting Codes},
author = {Lev Yohananov and Moshe Schwartz},
journal= {arXiv preprint arXiv:2312.00394},
year = {2024}
}