NobleBlocks
Public

Coding for computing

Published • Nov 19, 2002
Authors:
Alon Orlitsky
,
J.R. Roche

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...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!