We study two basic problems regarding edit errors (insertions and deletions). The first one is
document exchange, where two parties Alice and Bob hold two strings x and y with a …

This paper gives new results for synchronization strings, a powerful combinatorial object
introduced by [Haeupler, Shahrasbi; STOC'17] that allows to efficiently deal with insertions …

We present many new results related to reliable (interactive) communication over insertion-
deletion channels. Synchronization errors, such as insertions and deletions, strictly …

In this work, we study the problem of list decoding of insertions and deletions. We present a
Johnson-type upper bound on the maximum list size. The bound is meaningful only when …

Document exchange and error correcting codes are two fundamental problems regarding
communications. In the first problem, Alice and Bob each holds a string, and the goal is for …

We introduce a model of quantum insertion-deletion (insdel) channels. Insdel channels are
meant to represent, for example, synchronization errors arising in data transmission. In the …

The problem of constructing codes resilient to deletions, where bits go missing and a
subsequence is received, has a long history. Optimal binary single-deletion codes, which …

The thesis focuses on two problems about pseudorandom constructions. The first problem is
how to compute pseudorandom constructions by constant depth circuits. Pseudorandom …

In this paper, two moment balancing schemes, namely a variable index scheme and a fixed
index scheme, for either single insertion/deletion error correction or multiple substitution …