Optimal error rates for interactive coding I: adaptivity and other settings

We consider the task of interactive communication in the presence of adversarial errors and present tight bounds on the tolerable error-rates in a number of different settings. Most significantly, we explore adaptive interactive communication where the communicating parties decide who should speak next based on the history of the interaction. In particular, this decision can depend on estimates of the amount of errors that have occurred so far. Braverman and Rao [STOC'11] show that non-adaptively one can code for any constant error rate below 1/4 but not more. They asked whether this bound could be improved using adaptivity. We answer this open question in the affirmative (with a slightly different collection of resources): Our adaptive coding scheme tolerates any error rate below 2/7 and we show that tolerating a higher error rate is impossible. We also show that in the setting of Franklin et al. [CRYPTO'13], where parties share randomness not known to the adversary, adaptivity increases the tolerable error rate from 1/2 to 2/3. For list-decodable interactive communications, where each party outputs a constant size list of possible outcomes, the tight tolerable error rate is 1/2. Our negative results hold even if the communication and computation are unbounded, whereas for our positive results communication and computations are polynomially bounded. Most prior work considered coding schemes with linear communication bounds, while allowing unbounded computations. We argue that studying tolerable error rates in this relaxed context helps to identify a setting's intrinsic optimal error rate. We set forward a strong working hypothesis which stipulates that for any setting the maximum tolerable error rate is independent of many computational and communication complexity measures. We believe this hypothesis to be a powerful guideline for the design of simple, natural, and efficient coding schemes and for understanding the (im)possibilities of coding for interactive communications.

[1]  Amit Sahai,et al.  Adaptive protocols for interactive communication , 2013, 2016 IEEE International Symposium on Information Theory (ISIT).

[2]  G. David Forney,et al.  Concatenated codes , 2009, Scholarpedia.

[3]  Mark Braverman,et al.  Towards deterministic tree code constructions , 2012, ITCS '12.

[4]  Yael Tauman Kalai,et al.  Efficient Interactive Coding against Adversarial Noise , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[5]  Moni Naor,et al.  Fast Algorithms for Interactive Coding , 2013, SODA.

[6]  Mark Braverman Coding for interactive computation: Progress and challenges , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Rafail Ostrovsky,et al.  Optimal Coding for Streaming Authentication and Interactive Communication , 2015, IEEE Transactions on Information Theory.

[8]  Mark Braverman,et al.  List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise , 2014, FOCS.

[9]  Kai-Min Chung,et al.  Knowledge-Preserving Interactive Coding , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[10]  Leonard J. Schulman Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.

[11]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[12]  Mark Braverman,et al.  Toward Coding for Maximum Errors in Interactive Communication , 2011, IEEE Transactions on Information Theory.

[13]  Bernhard Haeupler,et al.  Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.