On interactive communication

IEEE Transactions on Information Theory

Volumn 43, Issue 1, 1997, Pages 22-37

  Ahlswede, Rudolf ^a   Cai, Ning ^a   Zhang, Zhen ^b,c  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c IEEE

Author keywords

Abstract sources; Average degree bound; Communication complexity; Hypergraph covering and coloring; Worst case complexity

Indexed keywords

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); MATHEMATICAL MODELS;

ABSTRACT CORRELATED SOURCE; AVERAGE DEGREE BOUND; COMMUNICATION COMPLEXITY; HYPERGRAPH COVERING AND COLORING; MULTIUSER CODING THEOREM;

ENCODING (SYMBOLS);

EID: 0030736654     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567643     Document Type: Article

References (39)

1. C. E. Shannon, "Two-way communication channels," in Proc. 4th Berkeley Symp. on Mathematical Statistics and Probability, vol. 1. Berkeley, CA: Univ. of California Press, 1961, pp. 611-614.
2. R. Ahlswede, "Multi-way communication channels," in Proc. of 2nd Inf. Symp. on Information Theory (Tsakkadsor, Armenian SSR, 1971), pp. 23-52.
3. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inform. Theory, vol. IT-19, pp. 471-480, 1973.
4. R. Ahlswede, "Channel capacities for list codes," J. Appl. Probab., vol. 10. pp. 824-836, 1973.
5. _, "Coloring hypergraphs: A new approach to multi-user source coding," J. Comb. Inform. Syst. Sci., pt. I, vol. 4, pp. 76-115, 1979;
6. J. Comb. Inform. Syst. Sci. pt. II. vol. 5, pp. 220-268, 1980.
7. A. C. Yao, "Some complexity questions related to distributive computing," in Proc. 11th Annual ACM Symp. on the Theory of Computing, 1979, pp. 209-213.
8. R. Ahlswede and I. Csiszár, "To get a bit of information may be as hard as to get full information," IEEE Trans. Inform. Theory, vol. IT-27, pp. 398-408, 1980.
9. A. El Gamal, "A simple proof of the Ahlswede-Csiszár 1-bit theorem," IEEE Trans. Inform. Theory, vol. IT-29, pp. 931-933, 1983.
10. A. El Gamal and K. F. Pang, "Communication complexity of computing the Hamming distance," SIAM J. Comput., vol. 15, pp. 932-947, 1986.
11. R. Ahlswede, A. El Gamal, and K. F. Pang, "A two-family extremal problem in Hamming space," Discr. Math., vol. 49, pp. 1-5, 1984.
12. P. Delsarte and P. Piret, "An extension of an inequality by Ahlswede, El Gamal, and Pang for pairs of binary codes," Discr. Math., vol. 55, pp. 313-315, 1985.
13. J. I. Hall and J. H. van Lint, "Constant distance code pairs," Proc. Kon. Nederl. Akad. Welensch., Ser. A, vol. 88, pp. 41-45, 1985.
14. R. Ahlswede and M. Moers, "Inequalities for code pairs," European J. Comb., vol. 9, pp. 175-181, 1987.
15. N. Cai, "A bound of sizes of code pairs satisfying the strong 4-words property for Lee distance," J. Syst. Sci. and Math. Sci., vol. 6, pp. 129-135, 1986.
16. R. Ahlswede, "On code pairs with specified Hamming distance," Colloquia Mathematica Societatis Janos Bolyai, Combinatorics, Eger, vol. 52, pp. 9-47, 1987.
17. R. Ahlswede, N. Cai, and Z. Zhang, "A general 4-words inequality with consequences for 2-way communication complexity," Adv. Appl. Math., vol. 10, pp. 75-94, 1989.
18. U. Tamm, "Communication complexity of sum-type functions invariant under translation," Inform. Computat., vol. 116, pp. 162-173, 1995.
19. R. Ahlswede and N. Cai, "On communication complexity of vector-valued functions," IEEE Trans. Inform. Theory, vol. 40, pp. 2062-2067, 1994.
20. R. Ahlswede, N. Cai, and U. Tamm, "Communication complexity in lattices," Appl. Math. Lett., vol. 6, pp. 53-58, 1993.
21. R. Ahlswede and N. Cai, "2-way communication complexity of sum-type functions for one processor to be informed," Probl. Pered. Inform., vol. 30, pp. 3-12, 1994.
22. A. El Gamal and A. Orlitsky, "Interactive data compression," in Proc. 25th Annu. Symp. on Foundations of Computer Science, 1984, pp. 100-108.
23. A. Orlitsky, "Worst-case interactive communication I: Two messages are almost optimal," IEEE Trans. Inform. Theory, vol. 36, pp. 1111-1127, 1990.
24. _, "Worst-case interactive communication II: Two messages are not optimal," IEEE Trans. Inform. Theory, vol. 37, pp. 995-1005, 1991.
25. _, "Interactive communication, balanced distributions, correlated files, and average case complexity," in Proc. 23rd Annu. Symp. on Foundations of Computer Science, 1991, pp. 228-238.
26. _, "Average-case interactive communication," IEEE Trans. Inform. Theory, vol. 38, pp. 1534-1547, 1992.
27. R. Ahlswede and T. S. Han, "On source coding with side information via a multiple-access channel and related problems in multi-user information theory," IEEE Trans. Inform. Theory, vol. IT-29, pp. 396-412, 1983.
28. T. Feder, E. Kushilevitz, and M. Noar, "Amortized communication complexity," in Proc. 32nd Annu. Symp. on Foundations of Computer Science, 1991, pp. 239-248.
29. M. Noar, A. Orlitsky, and P. Shor, "Three results on interactive communication," IEEE Trans. Inform. Theory, vol. 39, pp. 1608-1615, 1993.
30. Z. Zhang and X. G. Xia, "Three messages are not optimal in worst-case interactive communication," preprint, Jan. 1993.
31. M. L. Fredman and J. Komlós, "On the size of separating systems and families of perfect hash functions," SIAM J. Alg. and Discr. Methods, vol. 5, pp. 61-68, 1984.
32. N. Alon and J. H. Spencer, The Probabilistic Method (Wiley-Interscience Series in Discrete Mathematics and Optimization). New York: Wiley, 1992.
33. Z. Baranyai, "On the factorization of the complete uniform hypergraph," Colloquia Mathematica Societatis, Janos Bolyai 10. (Infinite and Finite Sets), Kezthely, Hungary, pp. 91-108, 1975.
34. A. Schrijver, "Packing and covering in combinatorics," Math. Centre Tracts 106 (Mathematisk Centrum, Amsterdam, The Netherlands), 1979.
35. V. G. Vizing, "On an estimate of the chromatic class of a p-graph," Diskret. Analiz., vol. 3, pp. 25-30, 1964 (in Russian).
36. C. E. Shannon, "A theorem on coloring the lines of a network," J. Math. Phys., vol. 28, pp. 148-151, 1949.
37. R. Ahlswede, "On set coverings in Cartesian product spaces," SFB 343 Diskrete Strukturen in der Mathematik (Bielefeld, Ergänzungsreihe), pp. 92-005, 1992.
38. C. H. Papadimitriou and M. Sipser, "Communication complexity," in Proc. 14th Annu. ACM Symp. on the Theory of Computing, 1982, pp. 196-200.
39. P. Duris, Z. Galil, and G. Schnitger, "Lower bounds on communication complexity," in Proc. 16th Annu. ACM Symp. on the Theory of Computing, 1984, pp. 81-91.