Efficient Coding for Interactive Communication

We revisit the problem of reliable interactive communication over a noisy channel and obtain the first fully (randomized) efficient constant-rate emulation procedure for reliable interactive communication. Our protocol works for any discrete memoryless noisy channel with constant capacity and fails with exponentially small probability in the total length of the protocol. Following a work by Schulman (1993), our simulation uses a tree-code, yet as opposed to the nonefficient construction of absolute tree-code used by Schulman, we introduce a relaxation in the notion of goodness for a tree code and define a potent tree code. This relaxation allows us to construct an efficient emulation procedure for any two-party protocol. Our results also extend to the case of interactive multiparty communication. We show that a randomly generated tree code (with suitable constant alphabet size) is an efficiently decodable potent tree code with overwhelming probability. Furthermore, we are able to partially derandomize this result by means of epsilon-biased distributions using only O(N) random bits, where N is the depth of the tree.

[1]  Robert G. Gallager,et al.  Finding parity in a simple broadcast network , 1988, IEEE Trans. Inf. Theory.

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

[3]  Barney. Reiffen,et al.  Sequential encoding and decoding for the discrete memoryless channel , 1960 .

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

[5]  John M. Wozencraft,et al.  Sequential decoding for reliable communication , 1957 .

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

[7]  Karthekeyan Chandrasekaran,et al.  Deterministic algorithms for the Lovász Local Lemma , 2009, SODA '10.

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

[9]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[10]  Amit Sahai,et al.  Potent Tree Codes and their applications: Coding for Interactive Communication, revisited , 2011, ArXiv.

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

[12]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[13]  Noga Alon,et al.  The Moore Bound for Irregular Graphs , 2002, Graphs Comb..

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

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

[16]  Robert Mario Fano,et al.  A heuristic discussion of probabilistic decoding , 1963, IEEE Trans. Inf. Theory.

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

[18]  Rafail Ostrovsky,et al.  Error-correcting codes for automatic control , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

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

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

[21]  L. Sunil Chandran.  A High Girth Graph Construction , 2003, SIAM J. Discret. Math..

[22]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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

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

[25]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

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

[27]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

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

[29]  Gábor Tardos,et al.  A constructive proof of the general lovász local lemma , 2009, JACM.

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