Coding for computing

  • Authors:
  • A. Orlitsky;J. R. Roche

  • Affiliations:
  • Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 755.20

Visualization

Abstract

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