Coding for computing
Alon Orlitsky, J.R. Roche · IEEE Transactions on Information Theory · 2001
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.