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 …

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 …

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 beeping 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 …

We consider the problem of making distributed computations robust to noise, in particular to
worst-case (adversarial) corruptions of messages. We give a general distributed interactive …

In the field of interactive coding, two or more parties wish to carry out a distributed
computation over a communication network that may be noisy. The ultimate goal is to …

Single-hop radio networks (SHRN) are a well studied abstraction of communication over a
wireless channel. In this model, in every round, each of the n participating parties may …