Coding for computing

A sender communicates with a receiver who wishes to reliably evaluate a function of their combined data. We show that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph. We also determine the number of bits needed when the communicators exchange two messages. Reference is made to the results of rate distortion in evaluating the function of two random variables.

[1]  János Körner,et al.  New Bounds for Perfect Hashing via Information Theory , 1988, Eur. J. Comb..

[2]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[3]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[4]  Avi Wigderson,et al.  Perfect hashing, graph entropy, and circuit complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[5]  H. S. WITSENHAUSEN,et al.  The zero-error side information problem and chromatic numbers (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[6]  Toby Berger,et al.  Rate-distortion for correlated sources with partially separated encoders , 1982, IEEE Trans. Inf. Theory.

[7]  Toby Berger,et al.  The CEO problem [multiterminal source coding] , 1996, IEEE Trans. Inf. Theory.

[8]  László Lovász,et al.  Entropy splitting for antiblocking corners and perfect graphs , 1990, Comb..

[9]  Jaikumar Radhakrishnan.  Better bounds for threshold formulas , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Alon Orlitsky,et al.  Worst-case interactive communication I: Two messages are almost optimal , 1990, IEEE Trans. Inf. Theory.

[11]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[12]  T. Feder,et al.  Amortized communication complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[14]  Jeff Kahn,et al.  Entropy and sorting , 1992, STOC '92.

[15]  Gábor Simonyi,et al.  Graph entropy: A survey , 1993, Combinatorial Optimization.

[16]  J. Komlos,et al.  On the Size of Separating Systems and Families of Perfect Hash Functions , 1984 .

[17]  J. Körner.  Fredman-Kolmo´s bounds and information theory , 1986 .

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

[19]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[20]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.