We introduce synchronization strings, which provide a novel way of efficiently dealing with
synchronization errors, ie, insertions and deletions. Synchronization errors are strictly more …

Coding for interactive communication augments coding theory to the interactive setting:
instead of communicating a message from a sender to a receiver, here the parties are …

We provide the first capacity approaching coding schemes that robustly simulate any
interactive protocol over an adversarial channel that corrupts any fraction of the transmitted …

We provide tight upper and lower bounds on the noise resilience of interactive
communication over noisy channels with feedback. In this setting, we show that the maximal …

We consider the question of interactive communication, in which two remote parties perform
a computation, while their communication channel is (adversarially) noisy. We extend here …

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

We consider the task of multiparty computation performed over networks in the presence of
random noise. Given an n-party protocol that takes R rounds assuming noiseless …

In interactive coding, Alice and Bob wish to compute some function f of their individual
private inputs x and y. They do this by engaging in a non-adaptive (fixed order, fixed length) …

How much adversarial noise can protocols for interactive communication tolerate? This
question was examined by Braverman and Rao (IEEE Trans. Inf. Theory, 2014) for the case …

We study coding schemes for multiparty interactive communication over synchronous
networks that suffer from stochastic noise, where each bit is independently flipped with …