Efficient and explicit coding for interactive communication

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 768-777

  Gelles, Ran ^a   Moitra, Ankur ^b   Sahai, Amit ^a  

^a Department of Civil and Environmental Engineering   (United States)

^b IAS   (United States)

Author keywords

derandomization; interactive communication with noise; tree codes

Indexed keywords

ALPHABET SIZE; DERANDOMIZATION; DISCRETE MEMORY; INTERACTIVE COMMUNICATIONS; MULTI-PARTY COMMUNICATION; NOISY CHANNEL; RANDOM BITS; SCHULMAN; TOTAL LENGTH; TREE CODES; TWO-PARTY PROTOCOLS;

COMMUNICATION; COMPUTER SCIENCE;

FORESTRY;

CODING; COMMUNICATION; COMPUTERS; NOISE; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

EID: 84863326122     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.51     Document Type: Conference Paper

References (17)

1. N. Alon, O. Goldreich, J. Håastad, and R. Peralta, "Simple constructions of almost k-wise independent random variables," Random Structures & Algorithms, vol. 3, no. 3, pp. 289-304, 1992.
2. M. Braverman and A. Rao, "Towards coding for maximum errors in interactive communication," in STOC 2011, pp. 159-166.
3. R. M. Fano, "A heuristic discussion of probabilistic decoding," IEEE Transactions on Information Theory, vol. 9, no. 2, pp. 64-74, 1963.
4. R. Gelles and A. Sahai, "Potent Tree Codes and their applications: Coding for Interactive Communication, revisited," Apr. 2011, arXiv:1104.0739 (cs.DS).
5. J. Naor and M. Naor, "Small-bias probability spaces: efficient constructions and applications," in STOC 1990, pp. 213-223.
6. R. Ostrovsky, Y. Rabani, and L. J. Schulman, "Error-correcting codes for automatic control," in FOCS 2005, pp. 309-316.
7. M. Peczarski, "An improvement of the tree code construction, "Information Processing Letters, vol. 99, no. 3, pp. 92-95, 2006.
8. S. Rajagopalan and L. Schulman, "A coding theorem for distributed computation," in STOC 1994, pp. 790-799.
9. B. Reiffen, "Sequential encoding and decoding for the discrete memoryless channel," Research Laboratory of Electronics. Massachusetts Institute of Technology, Tech. Rep. 374, 1960.
10. L. J. Schulman, "Communication on noisy channels: a coding theorem for computation," FOCS 1992, pp. 724-733.
11. -, "Deterministic coding for interactive communication," in STOC 1993, pp. 747-756.
12. -, "Coding for interactive communication," IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1745-1756, 1996.
13. -, "Postscript to "coding for interactive communication", " 2003, Schulman's homepage. http://www.cs.caltech.edu/~schulman/Papers/ intercodingpostscript.txt.
14. C. E. Shannon, "A mathematical theory of communication," ACM SIGMOBILE Mobile Computing and Communications Review, vol. 5, no. 1, pp. 3-55, 2001,
15. originally appeared in Bell System Tech. J. 27:379-423, 623-656, 1948.
16. U. V. Vazirani, "Randomness, Adversaries and Computation," Ph.D. dissertation, EECS, UC Berkeley, 1986.
17. J. M. Wozencraft, "Sequential decoding for reliable communication,"Massachusetts Institute of Technology, Tech. Rep. 325, 1957.