2025/07/18 by Yajuan Liu, Liu, Yajuan, Tolga M. Duman +1
Biochemistry, Genetics and Molecular Biology · #Advanced biosensing and bioanalysis techniques #DNA and Biological Computing #FOS: Computer and information sciences #Gene expression and cancer classification #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2507.14070
openalex publication_date 2025/07/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study segmented burst-deletion channels motivated by the observation that synchronization errors commonly occur in a bursty manner in real-world settings. In this channel model, transmitted sequences are implicitly divided into non-overlapping segments, each of which may experience at most one burst of deletions. In this paper, we develop error correction codes for segmented burst-deletion channels over arbitrary alphabets under the assumption that each segment may contain only one burst of t-deletions. The main idea is to encode the input subsequence corresponding to each segment using existing one-burst deletion codes, with additional constraints that enable the decoder to identify segment boundaries during the decoding process from the received sequence. The resulting codes achieve redundancy that scales as O(log b), where b is the length of each segment.