Some bounds on the capacity of communicating the sum of sources

We consider directed acyclic networks with multiple sources and multiple terminals where each source generates one i.i.d. random process over a finite field 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 sum-networks, and present some bounds in terms of min-cut, and the numbers of sources and terminals.

[1]  Panganamala Ramana Kumar,et al.  Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[2]  Massimo Franceschetti,et al.  Network computing capacity for the reverse butterfly network , 2009, 2009 IEEE International Symposium on Information Theory.

[3]  ZegerKenneth,et al.  Unachievability of network coding capacity , 2006 .

[4]  Tracey Ho,et al.  Network codes as codes on graphs , 2005 .

[5]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[6]  Randall Dougherty,et al.  Unachievability of network coding capacity , 2006, IEEE Transactions on Information Theory.

[7]  Brijesh Kumar Rai,et al.  Feasible alphabets for communicating the sum of sources over a network , 2009, 2009 IEEE International Symposium on Information Theory.

[8]  Michelle Effros,et al.  Functional Source Coding for Networks with Receiver Side Information ∗ , 2004 .

[9]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[10]  János Körner,et al.  How to encode the modulo-two sum of binary sources (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[11]  Aditya Ramamoorthy.  Communicating the sum of sources over a network , 2008, ISIT.

[12]  Michael Langberg,et al.  Communicating the sum of sources in a 3-sources/3-terminals network , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  M. Franceschetti,et al.  Network coding for computing , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[14]  Randall Dougherty,et al.  Linear Network Codes and Systems of Polynomial Equations , 2008, IEEE Transactions on Information Theory.

[15]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[16]  Robert G. Gallager,et al.  Finding parity in a simple broadcast network , 1988, IEEE Trans. Inf. Theory.

[17]  Te Sun Han,et al.  A dichotomy of functions F(X, Y) of correlated sources (X, Y) , 1987, IEEE Trans. Inf. Theory.

[18]  Michael Langberg,et al.  On the Hardness of Approximating the Network Coding Capacity , 2008, IEEE Transactions on Information Theory.

[19]  T. Ho,et al.  On Linear Network Coding , 2010 .

[20]  Randall Dougherty,et al.  Network routing capacity , 2005, IEEE Transactions on Information Theory.

[21]  Abhay Karandikar,et al.  Some results on communicating the sum of sources over a network , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

[22]  Brijesh Kumar Rai,et al.  Sum-networks: system of polynomial equations, reversibility, insufficiency of linear network coding, unachievability of coding capacity , 2009 .

[23]  Yashodhan Kanoria,et al.  On Distributed Computation in Noisy Random Planar Networks , 2007, 2007 IEEE International Symposium on Information Theory.