Synchronization channels, such as the well-known deletion channel, are surprisingly harder
to analyze than memoryless channels, and they are a source of many fundamental problems …

The purpose of this survey is to describe recent progress in the study of the binary deletion
channel and related channels with synchronization errors, including a clear description of …

Explicit nonasymptotic upper bounds on the sizes of multiple-deletion correcting codes are
presented. In particular, the largest single-deletion correcting code for q-ary alphabet and …

Nanopore sequencing is an emerging new technology for sequencing Deoxyribonucleic
acid (DNA), which can read long fragments of DNA (~ 50000 bases), in contrast to most …

We develop a systematic approach, based on convex programming and real analysis for
obtaining upper bounds on the capacity of the binary deletion channel and, more generally …

We consider the problem of constructing codes that can correct δ deletions occurring in an
arbitrary binary string of length n bits. Varshamov-Tenengolts (VT) codes, dating back to …

The problem of reconstructing a sequence when observed through multiple looks over
deletion channels occurs in “de novo” DNA sequencing. The DNA could be sequenced …

We study the application of polar codes in deletion channels by analyzing the cascade of a
binary erasure channel (BEC) and a deletion channel. We show how polar codes can be …

We consider deletion channels and insertion channels under an additional segmentation
assumption: the input consists of disjoint segments of b consecutive bits, with at most one …

In this paper, we directly lower bound the information capacity for channels with
independent identically distributed (iid) deletions and duplications. Our approach differs …