Coding for computing

IEEE Transactions on Information Theory

Volumn 47, Issue 3, 2001, Pages 903-917

  Orlitsky, Alon ^a,c   Roche, James R ^a,b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NATIONAL SECURITY AGENCY   (United States)

^c IEEE   (United States)

Author keywords

Coding for computing; Communication complexity; Rate distortion

Indexed keywords

DATA COMMUNICATION SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SIGNAL DISTORTION; SIGNAL ENCODING;

COMMUNICATION COMPLEXITY; RATE DISTORTION;

INFORMATION THEORY;

EID: 0035271234     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.915643     Document Type: Article

References (23)

1. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
2. T. Berger, “Multiterminal source coding,” in The Information Theory Approach to Communications, G. Longo, Ed. Berlin, Germany: Springer-Verlag, 1978, CISM Courses and Lectures, vol. 229, pp. 171–231.
3. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
4. I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 339–348, May 1978.
5. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
6. I. Csiszár, J. Körner, L. Lovász, K. Marton, and G. Simonyi, “Entropy splitting for antiblocking pairs and perfect graphs,” Combinatorica, vol. 10, no. 1, pp. 27–40, 1990.
7. T. Feder, E. Kushilevitz, and M. Naor, “Amortized communication complexity,” in Proc. 32nd Annu. Symp. Foundations of Computer Science, 1991, pp. 239–248.
8. M. L. Fredman and J. Komlos, “On the size of separating systems and families of perfect hash functions,” SIAM J. Algebr. Discrete Methods, vol. 5, no. 1, pp. 61–68, 1984.
9. J. Kahn and J. H. Kim, “Entropy and sorting,” in Proc. 24th Annu. ACM Symp. Theory of Computing, 1992, pp. 178–187.
10. A. H. Kaspi and T. Berger, “Rate-distortion for correlated sources,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 828–840, Nov. 1982.
11. J. Kömer, “Coding of an information source having ambiguous alphabet and the entropy of graphs,” in Proc. 6th Prague Conf. Information Theory, 1973, pp. 411–425.
12. J. Kömer, “Fredman-Komlos bounds and information theory,” SIAM J. Algebr. Discrete Methods, vol. 7, pp. 560–570, 1986.
13. J. Kömer and K. Marton, “New bounds for perfect hashing via information theory,” Eur. J. Combin., vol. 9, pp. 523–530, 1988.
14. I. Newman, P. Ragde, and A. Wigderson, “Perfect hashing, graph entropy, and circuit complexity,” in Proc. 5th Annu. Conf. Structure in Complexity Theory, 1991, pp. 91–100.
15. A. Orlitsky, “Worst case interactive communication I: Two messages are almost optimal,” IEEE Trans. Inform. Theory, vol. 36, pp. 1111–1126, Sept. 1990.
16. M. O. Rabin and A. C. Yao, private communication, 1979, unpublished manuscript.
17. J. Radhakrishnan, “Better bounds for threshold formulas,” in Proc. 32nd Annu. Symp. Foundations of Computer Science, Oct. 1991, pp. 314–323.
18. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379–423, 623–656, 1948.
19. G. Simonyi, “Graph entropy: A survey,” in Combinatorial Optimization: Papers from the DIMACS Special Year. ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, W. Cook, L. Lovász, and P. Seymour, Eds. Providence, RI: Amer. Math. Soc., 1995, vol. 20, pp. 399–441.
20. D. Slepiam and J. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 471–480, July 1973.
21. H. Witsenhausen, “The zero-error side information problem and chromatic numbers,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 592–593, Sept. 1976.
22. A. D. Wyner and J. Ziv, “The rate distortion function for source coding with side information at the receiver,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 1–11, Jan. 1976.
23. A. C. Yao, “Some complexity questions related to distributive computing,” in Proc. 11th Annu. ACM Symp. Theory of Computing, 1979, pp. 209–213.