Systematic deletion correcting codes play an important role in applications of document
exchange. Yet despite a series of recent advances made in deletion correcting codes, most …

We consider construction of deletion and substitution correcting codes with low redundancy
and efficient encoding/decoding. First, by simplifying the method of Sima et al.(ISIT 2020) …

The problem of constructing optimal multiple deletion correcting codes has long been open
until recent break-through for binary cases. Yet comparatively less progress was made in the …

The problem of correcting deletions has received significant attention, partly because of the
prevalence of these errors in DNA data storage. In this paper, we study the problem of …

In this paper, we construct-ary two-deletion correcting codes and burst-deletion correcting
codes, where is an even integer. For two-deletion codes, our construction has redundancy …

Correcting insertions/deletions as well as substitution errors simultaneously plays an
important role in DNA-based storage systems as well as in classical communications. This …

We prove that there exists an absolute constant such that any binary code tolerating
adversarial deletions must satisfy and thus have rate asymptotically approaching 0. This is …

In this paper, by applying the precoding technique in conjunction with the syndrome
compression approach, we construct systematic t-deletion s-substitution correcting codes …

Due to its higher data density, longevity, energy efficiency, and ease of generating copies,
DNA is considered a promising technology for satisfying future storage needs. However, a …

Localized errors, which occur in windows with bounded lengths, are common in a range of
applications. Such errors can be modeled as k-substring edits, which replace one substring …