On the Coding Capacity of Reverse-Complement and Palindromic
Duplication-Correcting Codes
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.