Balancing Communication for Multi-party Interactive Coding

We consider interactive coding in a setting where $n$ parties wish to compute a joint function of their inputs via an interactive protocol over imperfect channels. We assume that adversarial errors can comprise a $\mathcal{O}(\frac{1}{n})$ fraction of the total communication, occurring anywhere on the communication network. Our goal is to maintain a constant multiplicative overhead in the total communication required, as compared to the error-free setting, and also to balance the workload over the different parties. We build upon the prior protocol of Jain, Kalai, and Lewko, but while that protocol relies on a single coordinator to shoulder a heavy burden throughout the protocol, we design a mechanism to pass the coordination duties from party to party, resulting in a more even distribution of communication over the course of the computation.

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

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

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

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

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

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

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

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

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

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

[11]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

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

[13]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

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

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