Feasible alphabets for communicating the sum of sources over a network

Details Feasible alphabets for communicating the sum of sources over a network Feasible alphabets for communicating the sum of sources over a network

2009-01-15

arxiv.org/abs/0901.2198v1

Computer Science

Information Theory

Scientific paper

We consider directed acyclic {\em sum-networks} with $m$ sources and $n$ terminals where the sources generate symbols from an arbitrary alphabet field $F$, and the terminals need to recover the sum of the sources over $F$. We show that for any co-finite set of primes, there is a sum-network which is solvable only over fields of characteristics belonging to that set. We further construct a sum-network where a scalar solution exists over all fields other than the binary field $F_2$. We also show that a sum-network is solvable over a field if and only if its reverse network is solvable over the same field.

Affiliated with

Also associated with

No associations

Rating

Feasible alphabets for 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 Feasible alphabets for 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 Feasible alphabets for communicating the sum of sources over a network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-589686