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 study coding schemes for multiparty interactive communication over synchronous
networks that suffer from stochastic noise, where each bit is independently flipped with …

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 …

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 …

We revisit the fundamental question of information exchange between n parties connected
by a noisy binary broadcast channel, where the noise affects the transmitter (EI-Gamal …

We show an explicit (that is, efficient and deterministic) capacity approaching interactive
coding scheme that simulates any interactive protocol under random errors with nearly …

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 …