Sciweavers

SODA
2016
ACM

Towards Optimal Deterministic Coding for Interactive Communication

8 years 7 months ago
Towards Optimal Deterministic Coding for Interactive Communication
We study efficient, deterministic interactive coding schemes that simulate any interactive protocol both under random and adversarial errors, and can achieve a constant communication rate independent of the protocol length. For channels that flip bits independently with probability < 1/2, our coding scheme achieves a communication rate of 1 − O( H( )) and a failure probability of exp(−n/ log n) in length n protocols. Prior to our work, all nontrivial deterministic schemes (either efficient or not)
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ro
Added 09 Apr 2016
Updated 09 Apr 2016
Type Journal
Year 2016
Where SODA
Authors Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson
Comments (0)