Adaptive protocols for interactive communication

How much adversarial noise can protocols for interactive communication tolerate? This question was examined by Braverman and Rao (IEEE Trans. Inf. Theory, 2014) for the case of “robust” protocols, where each party sends messages only in fixed and predetermined rounds. We consider a new class of protocols for interactive communication, which we call adaptive protocols. Such protocols adapt structurally to the noise induced by the channel in the sense that both the order of speaking, and the length of the protocol may vary depending on observed noise. We define models that capture adaptive protocols and study upper and lower bounds on the permissible noise rate in these models. When the length of the protocol may adaptively change according to the noise, we demonstrate a protocol that tolerates noise rates up to 1/3. When the order of speaking may adaptively change as well, we demonstrate a protocol that tolerates noise rates up to 2/3. Hence, adaptivity circumvents an impossibility result of 1/4 on the fraction of tolerable noise (Braverman and Rao, 2014).

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

[2]  Cristopher Moore,et al.  Tree codes and a conjecture on exponential sums , 2013, ITCS.

[3]  Russell Impagliazzo,et al.  Communication Complexity with Synchronized Clocks , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[4]  Leonard J. Schulman,et al.  Deterministic coding for interactive communication , 1993, STOC.

[5]  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.

[6]  Ran Raz,et al.  Interactive channel capacity , 2013, STOC '13.

[7]  Denis Pankratov,et al.  On the Power of Feedback in Interactive Channels , 2013 .

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

[9]  Yael Tauman Kalai,et al.  Interactive Coding for Multiparty Protocols , 2015, ITCS.

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

[11]  Leonard J. Schulman,et al.  A coding theorem for distributed computation , 1994, STOC '94.

[12]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[13]  Gilles Brassard,et al.  Noisy Interactive Quantum Communication , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[14]  Rafail Ostrovsky,et al.  Optimal Coding for Streaming Authentication and Interactive Communication , 2015, IEEE Trans. Inf. Theory.

[15]  Ran Gelles,et al.  Coding for Interactive Communication: A Survey , 2017, Found. Trends Theor. Comput. Sci..

[16]  Abbas Jamalipour,et al.  A tutorial on multiple access technologies for beyond 3G mobile networks , 2005, IEEE Communications Magazine.

[17]  Ran Gelles,et al.  Capacity of Interactive Communication over Erasure Channels and Channels with Feedback , 2015, SIAM J. Comput..

[18]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[19]  Amit Sahai,et al.  Efficient and Explicit Coding for Interactive Communication , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[20]  Madhu Sudan,et al.  Optimal error rates for interactive coding I: adaptivity and other settings , 2013, STOC.

[21]  Christina Fragouli,et al.  Silence-Based Communication , 2010, IEEE Transactions on Information Theory.

[22]  Leonard J. Schulman,et al.  The Adversarial Noise Threshold for Distributed Protocols , 2014, SODA.

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

[24]  Bernhard Haeupler,et al.  Interactive Channel Capacity Revisited , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[25]  Yael Tauman Kalai,et al.  Fast Interactive Coding against Adversarial Noise , 2014, JACM.

[26]  Klim Efremenko,et al.  Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback , 2015, IEEE Transactions on Information Theory.

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

[28]  Amit Sahai,et al.  Efficient Coding for Interactive Communication , 2014, IEEE Transactions on Information Theory.

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

[30]  Noga Alon,et al.  Reliable communication over highly connected noisy networks , 2016, Distributed Computing.

[31]  Leonard J. Schulman,et al.  Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[32]  Charles F. Hockett,et al.  A mathematical theory of communication , 1948, MOCO.

[33]  Tetsunao Matsuta,et al.  国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .

[34]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

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

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

[37]  Marcin Peczarski.  An improvement of the tree code construction , 2006, Inf. Process. Lett..

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