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 ...Show MoreMetadata
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.
Published in: IEEE Transactions on Information Theory ( Volume: 47, Issue: 3, March 2001)
DOI: 10.1109/18.915643
Contents 