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 initiate the study of error correcting codes over the multi-party adversarial broadcast
channel. Specifically, we consider the classic information dissemination problem where n …

Beeping networks consist of exceedingly simple computational devices whose
communication is based on beeps and silence. In this work, we introduce noisy beeping …

Any interactive protocol between a pair of parties can be reliably simulated in the presence
of noise with a multiplicative overhead on the number of rounds (Schulman 1996). The …

We analyze resilient protocols over noisy networks, focusing on the interesting setting where
n computing parties (clients) are supported by a set of k assisting servers. All communication …

We consider computations over networks with multiple broadcast channels that intersect at a
single party. Each broadcast link suffers from random bit-flip noise that affects the receivers …

This document is a working paper that summarizes the state of the art Interactive Coding
schemes. A preliminary version of this summary appeared in [Gel17]. Due to the vast …