Some results on communicating the sum of sources over a network

Details Some results on communicating the sum of sources over a network Some results on communicating the sum of sources over a network

2008-11-03

arxiv.org/abs/0811.0285v1

Computer Science

Information Theory

5 pages, 3 figures

Scientific paper

We consider the problem of communicating the sum of $m$ sources to $n$ terminals in a directed acyclic network. Recently, it was shown that for a network of unit capacity links with either $m=2$ or $n=2$, the sum of the sources can be communicated to the terminals if and only if every source-terminal pair is connected in the network. We show in this paper that for any finite set of primes, there exists a network where the sum of the sources can be communicated to the terminals only over finite fields of characteristic belonging to that set. As a corollary, this gives networks where the sum can not be communicated over any finite field even though every source is connected to every terminal.

Affiliated with

Also associated with

No associations

Rating

Some results on 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 Some results on 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 Some results on communicating the sum of sources over a network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233869