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

DOI10.1007/S10623-025-01627-7MaRDI QIDQ6933641zbMATH OpenFDO

Authors Lev Yohananov, Moshe Schwartz

Publication date 4 September 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-025-01627-7

zbMATH Keywords

coding capacityerror-correcting codespalindromic duplicationreverse-complement duplicationstring-duplication systems

Mathematics Subject Classification ID

Combinatorics on words (68R15) Combinatorial codes (94B25) Decoding (94B35)

Cites work

• Capacity and Expressiveness of Genomic Tandem Duplication
• Codes Correcting a Burst of Deletions or Insertions
• Duplication-correcting codes
• Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
• Error-Correcting Codes for Short Tandem Duplication and Edit Errors
• Low-Redundancy Codes for Correcting Multiple Short-Duplication and Edit Errors
• Non-binary codes for correcting a burst of at most \(t\) deletions
• On duplication-free codes for disjoint or equal-length errors
• On the long-term behavior of k-tuples frequencies in mutation systems
• On the Reverse-Complement String-Duplication System
• Single-Error Detection and Correction for Duplication and Substitution Channels
• The Capacity of String-Duplication Systems
• The Entropy Rate of Some Pólya String Models

Cited in

(1)

• Explicit construction of codes correcting a single reverse-complement duplication of arbitrary length

This page was built for publication: On the coding capacity of reverse-complement and palindromic duplication-correcting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933641)