Computer Science – Information Theory
Scientific paper
2010-01-23
Computer Science
Information Theory
Major revision in the structure of the paper. 24 pages, 15 figures. Shorter version accepted to ISIT 2010
Scientific paper
We consider a directed acyclic network with three sources and three terminals such that each source independently generates one symbol from a given field $F$ and each terminal wants to receive the sum (over $F$) of the source symbols. Each link in the network is considered to be error-free and delay-free and can carry one symbol from the field in each use. We call such a network a 3-source 3-terminal {\it $(3s/3t)$ sum-network}. In this paper, we give a necessary and sufficient condition for a $3s/3t$ sum-network to allow all the terminals to receive the sum of the source symbols over \textit{any} field. Some lemmas provide interesting simpler sufficient conditions for the same. We show that linear codes are sufficient for this problem for $3s/3t$ though they are known to be insufficient for arbitrary number of sources and terminals. We further show that in most cases, such networks are solvable by simple XOR coding. We also prove a recent conjecture that if fractional coding is allowed, then the coding capacity of a $3s/3t$ sum-network is either $0,2/3$ or $\geq 1$.
Dey Bikash Kumar
Shenvi Sagar
No associations
LandOfFree
On the solvability of 3-source 3-terminal sum-networks 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 On the solvability of 3-source 3-terminal sum-networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the solvability of 3-source 3-terminal sum-networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-514911