On the coding capacity of reverse-complement and palindromic duplication-correcting codes

Lev Yohananov; Moshe Schwartz

doi:10.1007/s10623-025-01627-7

On the coding capacity of reverse-complement and palindromic duplication-correcting codes

Lev Yohananov, Moshe Schwartz

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

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
Journal	Designs, Codes, and Cryptography
DOIs	https://doi.org/10.1007/s10623-025-01627-7
State	Accepted/In press - 1 Jan 2025

Keywords

Coding capacity
Error-correcting codes
Palindromic duplication
Reverse-complement duplication
String-duplication systems

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science Applications
Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1007/s10623-025-01627-7

Cite this

@article{f5262d32b2064e469ce19308558de42b,

title = "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.",

keywords = "Coding capacity, Error-correcting codes, Palindromic duplication, Reverse-complement duplication, String-duplication systems",

author = "Lev Yohananov and Moshe Schwartz",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2025.",

year = "2025",

month = jan,

day = "1",

doi = "10.1007/s10623-025-01627-7",

language = "الإنجليزيّة",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

}

TY - JOUR

T1 - On the coding capacity of reverse-complement and palindromic duplication-correcting codes

AU - Yohananov, Lev

AU - Schwartz, Moshe

N1 - Publisher Copyright: © The Author(s) 2025.

PY - 2025/1/1

Y1 - 2025/1/1

N2 - 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.

AB - 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.

KW - Coding capacity

KW - Error-correcting codes

KW - Palindromic duplication

KW - Reverse-complement duplication

KW - String-duplication systems

UR - http://www.scopus.com/inward/record.url?scp=105004693200&partnerID=8YFLogxK

U2 - 10.1007/s10623-025-01627-7

DO - 10.1007/s10623-025-01627-7

M3 - مقالة

SN - 0925-1022

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

ER -

On the coding capacity of reverse-complement and palindromic duplication-correcting codes

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this