2012 · 58 citations · 12 references
EngineeringCommunicationComputer ScienceDigital CommunicationFault-tolerant ComputingInformation TheoryChannel CodingCommunication ComplexityError Control CodingError-correcting CodesAdversarial RobustnessCodingCommunications ProtocolsEfficient Coding TheoryInteractive CommunicationInteractive Communication ModelRandomized Communication Complexity
In this work, we study the problem of constructing interactive protocols that are robust to noise, a problem that was originally considered in the seminal works of Schulman (FOCS '92, STOC '93), and has recently regained popularity. Robust interactive communication is the interactive analogue of error correcting codes: Given an interactive protocol which is designed to run on an error-free channel, construct a protocol that evaluates the same function (or, more generally, simulates the execution of the original protocol) over a noisy channel. As in (non-interactive) error correcting codes, the noise can be either stochastic, i.e. drawn from some distribution, or adversarial, i.e. arbitrary subject only to a global bound on the number of errors. We show how to efficiently simulate any interactive protocol in the presence of constant-rate adversarial noise, while incurring only a constant blow-up in the communication complexity (CC). Our simulator is randomized, and succeeds in simulating the original protocol with probability at least 1 - 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-Ω(CC)</sup> .
12
A Mathematical Theory of Communication
Claude E. Shannon · Bell System Technical Journal · 1948 · 80.7K citations
Simple Constructions of Almost k‐wise Independent Random Variables
Noga Alon, Oded Goldreich, Johan Håstad et al. · Random Structures and Algorithms · 1992 · 569 citations
Coding for interactive communication
Leonard J. Schulman · IEEE Transactions on Information Theory · 1996 · 194 citations