Some results on communicating the sum of sources over a network

2009 Workshop on Network Coding, Theory and Applications, NetCod '09

Volumn , Issue , 2009, Pages 92-97

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

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; FINITE FIELDS; FINITE SET; LINEAR NETWORK CODING; N-TERMINALS; UNIT CAPACITY;

INFORMATION THEORY; SET THEORY; TECHNICAL PRESENTATIONS;

LINEAR NETWORKS;

EID: 77950797691     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NETCOD.2009.5191400     Document Type: Conference Paper

References (15)

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. (Pubitemid 40843620)
5. Aditya Ramamoorthy. Communicating the sum of sources over a network. In Proceedings of ISIT, Toronto, Canada, July 06-11, pages 1646-1650, 2008.
6. J. N. Tsistsiklis. Decentralized detection by a large number of sensors. Mathematics of Control, Signals and Systems, 1(2): 167-182, 1988.
7. R. Viswanathan and P. K. Varshney. Distributed detection with multiple sensors: Part I-fundamental. Proceedings of IEEE, 85(1):54-63, 1997. (Pubitemid 127745547)
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. (Pubitemid 40519630)
10. Y. Kanoria and D. Manjunath. On distributed computation in noisy random planar networks. In Proceedings of ISIT, Nice, France, 2008.
11. S. Boyd, A. Ghosh, B. Prabhaar, and D. Shah. Gossip algorithms: design, analysis and applications. In Proceedings of IEEE INFOCOM, pages 1653-1664, 2005. (Pubitemid 41390681)
12. Aditya Ramamoorthy and Michael Langberg. 2008. personal communication.
13. 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.
14. M. Medard, 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.
15. 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.