Coding for interactive communication

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1745-1756

  Schulman, Leonard J ^a,b,c  

^a IEEE

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

Coding theorem; Distributed computing; Error correction; Interactive communication; Reliable communication; Tree code

Indexed keywords

CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; ERROR CORRECTION; INTERACTIVE COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SPURIOUS SIGNAL NOISE;

CODING THEOREM; INTERACTIVE COMMUNICATION; TREE CODES;

ENCODING (SYMBOLS);

EID: 0030287934     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556671     Document Type: Article

References (37)

1. E. R. Berlekamp, Block coding for the binary symmetric channel with noiseless, delayless feedback, in Error Correcting Codes, H. B. Mann, Ed. New York: Wiley, 1968, pp. 61-85.
2. R. L. Dobrushin and S. I. Ortyukov, Lower bound for the redundancy of self-correcling arrangement of unreliable functional elements, Probl. Inform. Transm., vol. 13, pp. 59-65, 1977
3. Upper bound for the redundancy of self-correcting arrangements of unreliable functional elements, Probl. Inform. Transm., vol. 13, pp. 203-218, 1977.
4. P. Elias, Computation in the presence of noise, IBM J. Res. Devel, vol. 2, no. 4, pp. 346-353, Oct. 5, 1958.
5. W. Evans, M. Klugerman, and L. J. Schulman, Constructive tree codes with polynomial size alphabet, unpublished manuscript.
6. W. Evans and L. J. Schulman, Signal propagation, with application to a lower bound on the depth of noisy formulas, in Proc. 34th Annu. Symp. on Foundations of Computer Science, 1993, pp. 594-603.
7. R. M. Fano, A heuristic discussion of probabilistic decoding, IEEE Trans. Inform. Theory, vol. IT-9, pp. 6474, 1963.
8. T. Feder, Reliable computation by networks in the presence of noise, IEEE Trans. Inform. Theory, vol. 35, no. 3, pp. 569-571, May 1989.
9. P. Gâcs, Reliable computation with cellular automata, J. Comp. Syst. Sei., vol. 32, pp. 15-78, 1986.
10. P. Gâcs and J. Reif, A simple three-dimensional real-time reliable cellular array, J. Comp. Syst. Sei., vol. 36, pp. 125-147, 1988.
11. A. Gâl, Lower bounds for the complexity of reliable Boolean circuits with noisy gates, in Proc. 32nd Annu. Symp. on Foundations of Computer Science, 1991, pp. 594-601.
12. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
13. -, Finding parity in a simple broadcast network, IEEE Trans. Inform. Theory, vol. 34, no. 2, pp. 176-180, Mar. 1988.
14. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed. Oxford, UK: Oxford Univ. Press, 1979.
15. J. Justesen, A class of constructive, asymptotically good algebraic codes, IEEE Trans. Inform. Theory, vol. IT-18, pp. 652-656, Sept. 1972.
16. M. Karchmer and A. Wigderson, Monotone circuits for connectivity require super-logarithmic depth, in Proc. 20th Annu. ACM Symp. on Theory of Computing, 1988, pp. 539-550.
17. Lipton and Sedgewick, Lower bounds for VLSI, in Proc. 13th Annu. ACM Symp. on Theory of Computing, 1981, pp. 300-307.
18. L. Lovâsz, Communication complexity: A survey, Algorithms and Combinatorics, Korde et al., Eds. New York: Springer-Verlag, 1990.
19. C. H. Papadimitriou and M. Sipser, Communication complexity, in Proc. 14th ACM Annu. Symp. on Theory of Computing, 1982, pp. 196-200.
20. W. W. Peterson and M. O. Rabin, On codes for checking logical operations, IBM J. Res. Devel., vol. 3, pp. 163-168, Apr. 1959.
21. N. Pippenger, On networks of noisy gates, in Proc. 26th Annu. Symp. on Foundations of Computer Science, 1985, pp. 30-36, 1985.
22. Reliable computation by formulas in the presence of noise, IEEE Trans. Inform. Theory, vol. 34, no. 2, pp. 194-197, Mar. 1988.
23. Invariance of complexity measures for networks with unreliable gates, J. Assoc. Comput. Mach., vol. 36, pp. 531-539, 1989.
24. B. Reiffen, Sequential encoding and decoding for the discrete memoryless channel, Res. Lab. of Electronics, MIT, Tech. Rep., vol. 374, 1960.
25. R. Reischuk and B. Schmeltz, Reliable computation with noisy circuits and decision trees-A general n log n lower bound, in Proc. 32nd Annu. Symp. on Foundations of Computer Science, 1991, pp. 602-611.
26. L. J. Schulman, Communication in the presence of noise, Ph.D. dissertation, MIT, Cambridge, MA, 1992.
27. Communication on noisy channels: A coding theorem for computation, in Proc. 33rd Annu. Symp. on Foundations of Computer Science, 1992, pp. 724-733.
28. Deterministic coding for interactive communication, in Proc. 25th Annu. ACM Symp. on Theory of Computing, 1993, pp. 747-756.
29. C. E. Shannon, A mathematical theory of communication, Bell Syst. Tech. J., vol. 27, pp. 379-423 and 623-656, 1948.
30. Two-way communication channels, in Proc. 4th Berkeley Symp. on Mathematical Statistics and Probability, 1961, vol. 1, pp. 611-644 (reprinted in Key Papers in Information Theory, D. Slepian, Ed. New York: IEEE Press, 1974.)
31. M. C. Taylor, Reliable information storage in memories designed from unreliable components, Bell Syst. Tech. ]., vol. 47, no. 10, pp. 2299-2337, 1968.
32. C. D. Thompson, Area-time complexity for VLSI, in Proc. llth Ann. ACM Sytnp. on Theory of Computing, 1979, pp. 81-88.
33. J. von Neumann, Probabilistic logics and the synthesis of reliable organizms from unreliable components, in Automata Studies, C. E. Shannon and J. McCarthy, Eds. Princeton, NJ: Princeton Univ. Press, 1956, pp. 43-98.
34. J. M. Wozencraft, Sequential decoding for reliable communications, Res. Lab. of Electron., MIT, Tech. Rep., 1957, vol. 325.
35. A. C. Yao, Probabilistic computations: Toward a unified measure of complexity, in Proc. 18th Ann. Symp. on Foundations of Computer Science, 1977, pp. 222-227.
36. Some complexity questions related to distributive computing, in Proc. llth Annu. ACM Symp. on Theory of Computing, 1979, pp. 209-213.
37. The entropie limitations on VLSI computations, in Proc. 13th Annu. ACM Symp. on Theory of Computing, 1981, pp. 308-311.