Some bounds on the capacity of communicating the sum of sources

IEEE Information Theory Workshop 2010, ITW 2010

Volumn , Issue , 2010, Pages

  Rai, Brijesh Kumar ^a   Dey, Bikash Kumar ^a   Shenvi, Sagar ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; FINITE FIELDS; MIN-CUT; MULTIPLE SOURCE; SOURCE PROCESS;

INFORMATION THEORY;

RANDOM PROCESSES;

EID: 77954833482     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWKSPS.2010.5503143     Document Type: Conference Paper

References (22)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Trans. Inform. Theory, 46(4):1204-1216, 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Trans. Inform. Theory, 49(2):371-381, 2003.
3. R. Koetter and M. Médard. An algebraic approach to network coding. IEEE/ACM Transactions on Networking, 11(5):782-795, 2003.
4. Sidharth Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen. Polynomial time algorithms for multicast network code construction. IEEE Trans. Inform. Theory, 51(6):1973-1982, 2005.
5. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger. Network routing capacity. IEEE Trans. Inform. Theory, 52(3):777-788, 2006.
6. Randall Dougherty, C. Freiling, and Kenneth Zeger. Unachievability of network coding capacity. IEEE Trans. Inform. Theory, 52(6):2365-2372, 2006.
7. Michael Langberg and A. Sprintson. On the hardness of approximating the network coding capacity. In Proceedings of IEEE International Symposium on Information Theory, Toronto, Canada, 2008.
8. R. G. Gallager. Finding parity in a simple broadcast network. IEEE Trans. Inform. Theory, 34:176-180, 1988.
9. A. Giridhar and P. R. Kumar. Computing and communicating functions over sensor networks. IEEE J. Select. Areas Commun., 23(4):755-764, 2005.
10. Y. Kanoria and D. Manjunath. On distributed computation in noisy random planar networks. In Proceedings of ISIT, Nice, France, 2008.
11. J. Korner and K. Marton. How to encode the modulo-two sum of binary sources. IEEE Trans. Inform. Theory, 25(2):219-221, 1979.
12. T. S. Han and K. Kobayashi. A dichotomy of functions f(x, y) of correlated sources (x, y). IEEE Trans. Inform. Theory, 33(1):69-86, 1987.
13. H. Feng, M. Effros, and S. A. Savari. Functional source coding for networks with receiver side information. In Proceedings of the Allerton Conference on Communication, Control, and Computing, September 2004.
14. Aditya Ramamoorthy. Communicating the sum of sources over a network. In Proceedings of ISIT, Toronto, Canada, July 06-11, pages 1646-1650, 2008.
15. Brijesh Kumar Rai, Bikash Kumar Dey, and Abhay Karandikar. Some results on communicating the sum of sources over a network. In Proceedings of NetCod 2009, 2009.
16. Michael Langberg and A. Ramamoorthy. Communicating the sum of sources in a 3-sources/3-terminals network. In Proceedings of IEEE International Symposium on Information Theory, Seoul, Korea, 2009.
17. Brijesh Kumar Rai and Bikash Kumar Dey. Feasible alphabets for communicating the sum of sources over a network. In Proceedings of IEEE International Symposium on Information Theory, Seoul, Korea, 2009.
18. Brijesh Kumar Rai and Bikash Kumar Dey. Sum-networks: system of polynomial equations, reversibility, insufficiency of linear network coding, unachievability of coding capacity. Submitted to IEEE Trans. Info. Theory, August 2009.
19. R. Dougherty, C. Freiling, and K. Zeger. Linear network codes and systems of polynomial equations. IEEE Trans. Inform. Theory, 54(5):2303-2316, 2008.
20. R. Koetter, M. Effros, T. Ho, and M. Médard. Network codes as codes on graphs. In Proceedings of the 38th annual conference on information sciences and systems (CISS), 2004.
21. N. Karamchandani R. Appuswamy, M. Franceschetti and K. Zeger. Network computing capacity for the reverse butterfly network. In Proceedings of IEEE International Symposium on Information Theory, Seoul, Korea, 2009.
22. N. Karamchandani R. Appuswamy, M. Franceschetti and K. Zeger. Network coding for computing. In Proceedings of Annual Allerton Conference, UIUC, IIlinois, USA, 2008.