This paper studies codes that correct a burst of deletions or insertions. Namely, a code will
be called a b-burst-deletion/insertion-correcting code if it can correct a burst of …

This paper studies problems in data reconstruction, an important area with numerous
applications. In particular, we examine the reconstruction of binary and nonbinary …

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 …

We consider deletion correcting codes over a q-ary alphabet. It is well known that any code
capable of correcting s deletions can also correct any combination of s total insertions and …

Although the insertion/deletion problem has been studied for more than fifty years, many
results still remain elusive. The goal of this work is to present three novel theorems with a …

Congruences are ubiquitous in computer science, engineering, mathematics, and related
areas. Develo** techniques for finding (the number of) solutions of congruences is an …

We introduce a general class of codes which includes several well-known classes of
deletion/insertion correcting codes as special cases. For example, the Helberg code, the …

A binary string transmitted via a memoryless iid deletion channel is received as a
subsequence of the original input. From this, one obtains a posterior distribution on the …

We investigate deletion correcting codes and restricted composition codes in particular.
Restricted composition codes generalize codes on permutations and multipermutations. We …

This paper studies new bounds and code constructions that are applicable to the
combinatorial granular channel model previously introduced by Sharov and Roth. We derive …