Communicating the sum of sources over a network

Details Communicating the sum of sources over a network Communicating the sum of sources over a network

2010-01-29

arxiv.org/abs/1001.5319v1

Computer Science

Information Theory

14 pages, 9 figures, submitted to the IEEE Transactions on Information Theory

Scientific paper

We consider the network communication scenario, over directed acyclic networks with unit capacity edges in which a number of sources $s_i$ each holding independent unit-entropy information $X_i$ wish to communicate the sum $\sum{X_i}$ to a set of terminals $t_j$. We show that in the case in which there are only two sources or only two terminals, communication is possible if and only if each source terminal pair $s_i/t_j$ is connected by at least a single path. For the more general communication problem in which there are three sources and three terminals, we prove that a single path connecting the source terminal pairs does not suffice to communicate $\sum{X_i}$. We then present an efficient encoding scheme which enables the communication of $\sum{X_i}$ for the three sources, three terminals case, given that each source terminal pair is connected by two edge disjoint paths. Our encoding scheme includes a structural decomposition of the network at hand which may be found useful for other network coding problems as well.

Affiliated with

Also associated with

No associations

Rating

Communicating the sum of sources over a network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Communicating the sum of sources over a network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communicating the sum of sources over a network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675770