Feasible alphabets for communicating the sum of sources over a network

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1353-1357

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

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY FIELDS; FINITE SET; LINEAR SOLUTION; N-TERMINALS;

SET THEORY;

INFORMATION THEORY;

EID: 70449516106     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205921     Document Type: Conference Paper

References (18)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204-1216, 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Transactions on Information 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. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen. Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory, 51(6):1973-1982, June 2005.
5. M. Médard, M. Effros, T. Ho, and D. Karger. On coding for nonmulticast networks. In Proceedings of 41st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, October 2003.
6. R. Dougherty, C. Freiling, and K. Zeger. Insufficiency of linear coding in network information flow. IEEE Trans. Inform. Theory, 51(8):2745-2759, 2005.
7. R. Dougherty, C. Freiling, and K. Zeger. Linear network codes and systems of polynomial equations. IEEE Trans. Inform. Theory, 54(5):2303-2316, 2008.
8. Aditya Ramamoorthy. Communicating the sum of sources over a network. In Proceedings of ISIT, Toronto, Canada, July 06-11, pages 1646-1650, 2008.
9. Brijesh Kumar Rai, Bikash Kumar Dey, and Abhay Karandikar. Some results on communicating the sum of sources over a network. Accepted in NetCod 2009. Also available at http://arxiv.org/abs/0811.0285.
10. J. N. Tsistsiklis. Decentralized detection by a large number of sensors. Mathematics of Control, Signals and Systems, 1(2):167-182, 1988.
11. R. G. Gallager. Finding parity in a simple broadcast network. IEEE Trans. Inform. Theory, 34:176-180, 1988.
12. A. Giridhar and P. R. Kumar. Computing and communicating functions over sensor networks. IEEE J. Select. Areas Commun., 23(4):755-764, 2005.
13. Y. Kanoria and D. Manjunath. On distributed computation in noisy random planar networks. In Proceedings of ISIT, Nice, France, 2008.
14. S. Boyd, A. Ghosh, B. Prabhaar, and D. Shah. Gossip algorithms: design, analysis and applications. In Proceedings of IEEE INFOCOM, pages 1653-1664, 2005.
15. Soren Riis. Reversible and irreversible information networks. In IEEE Trans. Inform. Theory, number 11, pages 4339-4349, 2007.
16. Randall Doughtery and Kenneth Zeger. Nonreversibility and equivalent constructions of multiple-unicast networks. IEEE Trans. Inform. Theory, 52(11):5067-5077, 2006.
17. A. Rasala Lehman and E. Lehman. Complexity classification of network information flow problems. In Proceedings of 41st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, October 2003.
18. S. Riis. Linear versus nonlinear boolean functions in network flow. In Proceedings of 38th Annual Conference on Information Sciences and Systems, Princeton, NJ, March 2004.