Deterministic coding for interactive communication
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Communication on noisy channels: a coding theorem for computation
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Towards coding for maximum errors in interactive communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Efficient and Explicit Coding for Interactive Communication
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Towards deterministic tree code constructions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Coding for interactive communication
IEEE Transactions on Information Theory - Part 1
Efficient Interactive Coding against Adversarial Noise
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We study the interactive channel capacity of an ε-noisy channel. The interactive channel capacity C(ε) is defined as the minimal ratio between the communication complexity of a problem (over a non-noisy channel), and the communication complexity of the same problem over the binary symmetric channel with noise rate ε, where the communication complexity tends to infinity. Our main result is the upper bound C(ε) ≤ 1-Ω(√H(ε)). This compares with Shannon's non-interactive channel capacity of 1-H(ε). In particular, for a small enough ε, our result gives the first separation between interactive and non-interactive channel capacity, answering an open problem by Schulman [Schulman1]. We complement this result by the lower bound C(ε) ≥ 1-O(√H(ε)), proved for the case where the players take alternating turns.