TY - JOUR

T1 - Distributed computing and the graph entropy region

AU - Shayevitz, Ofer

PY - 2014/6

Y1 - 2014/6

N2 - Two remote senders observe X and Y, respectively, and can noiselessly send information via a common relay node to a receiver that observes Z. The receiver wants to compute a function f (X, Y, Z) of these possibly related observations, without error. We study the average number of bits that need to be conveyed to that end by each sender to the relay and by the relay to the receiver, in the limit of multiple instances. We relate these quantities to the entropy region of a probabilistic graph with respect to a Cartesian representation of its vertex set, which we define as a natural extension of graph entropy. General properties and bounds for the graph entropy region are derived, and mapped back to special cases of the distributed computing setup.

AB - Two remote senders observe X and Y, respectively, and can noiselessly send information via a common relay node to a receiver that observes Z. The receiver wants to compute a function f (X, Y, Z) of these possibly related observations, without error. We study the average number of bits that need to be conveyed to that end by each sender to the relay and by the relay to the receiver, in the limit of multiple instances. We relate these quantities to the entropy region of a probabilistic graph with respect to a Cartesian representation of its vertex set, which we define as a natural extension of graph entropy. General properties and bounds for the graph entropy region are derived, and mapped back to special cases of the distributed computing setup.

KW - Distributed source coding

KW - graph entropy

KW - zero-error information theory

UR - http://www.scopus.com/inward/record.url?scp=84901371203&partnerID=8YFLogxK

U2 - 10.1109/TIT.2014.2303802

DO - 10.1109/TIT.2014.2303802

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84901371203

SN - 0018-9448

VL - 60

SP - 3435

EP - 3449

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

M1 - 6729087

ER -