Rounds vs queries trade-off in noisy computation
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds for the Noisy Broadcast Problem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Error-Correcting Codes for Automatic Control
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An improvement of the tree code construction
Information Processing Letters
Authenticated Adversarial Routing
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Error-correcting codes for automatic control
IEEE Transactions on Information Theory
Distributed function computation in asymmetric communication scenarios
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Towards coding for maximum errors in interactive communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Efficient probabilistically checkable debates
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Towards deterministic tree code constructions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Dimension reduction for finite trees in l1
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Making polynomials robust to noise
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The cost of fault tolerance in multi-party communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Private interactive communication across an adversarial channel
Proceedings of the 5th conference on Innovations in theoretical computer science
Tree codes and a conjecture on exponential sums
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.06 |
Let the input to a computation problem be split between two processors connected by a communication link; and let an interactive protocol π be known by which, on any input, the processors can solve the problem using no more than T transmissions of bits between them, provided the channel is noiseless in each direction. We study the following question: if in fact the channel is noisy, what is the effect upon the number of transmissions needed in order to solve the computation problem reliably? Technologically this concern is motivated by the increasing importance of communication as a resource in computing, and by the tradeoff in communications equipment between bandwidth, reliability, and expense. We treat a model with random channel noise. We describe a deterministic method for simulating noiseless-channel protocols on noisy channels, with only a constant slowdown. This is an analog for general, interactive protocols of Shannon's coding theorem, which deals only with data transmission, i.e., one-way protocols. We cannot use Shannon's block coding method because the bits exchanged in the protocol are determined only one at a time, dynamically, in the course of the interaction. Instead, we describe a simulation protocol using a new kind of code, explicit tree codes