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.
Authors
- Lev Yohananov (ORCID: https://orcid.org/0000-0003-3151-6192)
- Moshe Schwartz (ORCID: https://orcid.org/0000-0002-1449-0026)
Institutions
- Ben-Gurion University of the Negev (IL)
- Migal - Galilee Technology Center (IL)
- McMaster University (CA)
Publication Details
- Journal
- Designs Codes and Cryptography
- Published
- 2025-05-10
- DOI
- https://doi.org/10.1007/s10623-025-01627-7
- Citations
- 1
- Primary Topic
- DNA and Biological Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.81
Funders
- National Science Foundation
- Ben-Gurion University of the Negev