Some bounds on the capacity of communicating the sum of sources

Details Some bounds on the capacity of communicating the sum of sources Some bounds on the capacity of communicating the sum of sources

2009-07-13

arxiv.org/abs/0907.2090v2

Computer Science

Information Theory

Revised version

Scientific paper

We consider directed acyclic networks with multiple sources and multiple terminals where each source generates one i.i.d. random process over an abelian group and all the terminals want to recover the sum of these random processes. The different source processes are assumed to be independent. The solvability of such networks has been considered in some previous works. In this paper we investigate on the capacity of such networks, referred as {\it sum-networks}, and present some bounds in terms of min-cut, and the numbers of sources and terminals.

Affiliated with

Also associated with

No associations

Rating

Some bounds on the capacity of communicating the sum of sources 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 bounds on the capacity of communicating the sum of sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some bounds on the capacity of communicating the sum of sources will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100293