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 consider interactive communication performed over two types of noisy channels: binary
error channels with noiseless feedback and binary erasure channels. In both cases, the …

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 …

We consider the problem of implementing distributed protocols, despite adversarial channel
errors, on synchronous-messaging networks with arbitrary topology. In our first result we …

This paper makes progress on the problem of explicitly constructing a binary tree code with
constant distance and constant alphabet size. We give an explicit binary tree code with …

A set of n players, each holding a private input bit, communicate over a noisy broadcast
channel. Their mutual goal is for all players to learn all inputs. At each round one of the …

We study the effect of noise on the n-party bee** model. In this model, in every round,
each party may decide to either'beep'or not. All parties hear a beep if and only if at least one …

We address fully-defective asynchronous networks, in which all links are subject to an
unlimited number of alteration errors, implying that all messages in the network may be …

Multiparty interactive coding allows a network of n parties to perform distributed
computations when the communication channels suffer from noise. Previous results …