Network Coding for Computing

46th Annual Allerton Conference on Communication, Control, and Computing

Volumn , Issue , 2008, Pages 1-6

  Appuswamy, Rathinakumar ^a   Franceschetti, Massimo ^a   Karamchandani, Nikhil ^a   Zeger, Kenneth ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; COMPUTATION PROBLEMS; MIN CUTS; NETWORK CODING; NETWORK USAGES; RECEIVER NODES; SOURCE NODES; TREE NETWORKS; UPPER BOUNDS;

EID: 64549093327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797527     Document Type: Conference Paper

References (20)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow", IEEE Transactions on Information Theory, vol. IT-46, no. 4, pp. 1204-1216, July 2000.
2. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity", IEEE Transactions on Information Theory, vol. 52, no. 3, pp. 777-788, March 2006.
3. V. Doshi, D. Shah, M. Medard, and S. Jaggi, "Graph coloring and conditional graph entropy," Proceedings of the Fortieth Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, Nov. 2006.
4. V. Doshi, D. Shah, M. Medard, and S. Jaggi, "Distributed functional compression through graph coloring," Proceedings of the Data Compression Conference, Snow Bird, Utah, March 2007.
5. C. Dutta, Y. Kanoria, D. Manjunath, J. Radhakrishnan, "A tight lower bound for parity in noisy communication networks," Proceedings of the twentieth ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 1056-1065, San Francisco, CA, January 2008.
6. A. El Gamal, Open problem presented at the 1984 Workshop on Specific Problems in Communication and Computation sponsored by Bell Communication Research.
7. R. G. Gallager, "Finding parity in a simple broadcast network," IEEE Transactionson Information Theory, vol. 34, no. 2, pp. 176-180, March 1988.
8. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks," IEEE Journal on Selected Areas in Communications, vol. 23, no. 4, pp. 755-764, April 2005.
9. N. Goyal, G. Kindler, M. Saks, "Lower bounds for the noisy broadcast model," Proceedings of the 46th annual IEEE Symposium on Foundations of Computer Science (FOCS '05), pp. 40-49, Pittsburgh, PA, October 2005.
10. P. Gupta, S. Subramanian, and S. Shakkottai, "Scaling bounds for function computation over large sensor networks," Proceedings of the 2007 IEEE International Symposium on Information Theory (ISIT), Nice, France, June 24-29, 2007.
11. N. Harvey, R. Kleinberg, A. R. Lehman, "On the capacity of information networks," IEEE Transactions on Information Theory & IEEE/ACM Transactions on Networking (joint issue), vol. 52, no. 6, pp. 2345-2364, June 2006.
12. A. R. Lehman and E. Lehman, "Complexity classification of network information flow problems," Proceedings of thefifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 142-150, 2003.
13. T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," Journal of the ACM, vol. 46, no. 6, pp. 787-832, Nov. 1999.
14. B. Nazer, and M. Gastpar, "Computing over multiple-access channels," IEEE Transactions on Information Theory, vol. 53, no. 10, pp. 3498-3516, Oct. 2007.
15. C. K. Ngai, R. W. Yeung, "Network coding gain of combination networks," Proceedings of the IEEE Information Theory Workshop, San Antonio, Texas, October 2004.
16. A. Orlitsky, J. R. Roche, "Coding for computing," IEEE Transactions on Information Theory, vol. 47, no. 3, pp. 903-917, March 2001.
17. M. D. Penrose, "Random Geometric Graphs", Oxford University Press, 2003.
18. A. Ramamoorthy, "Communicating the sum of sources over a network," Proceedings of the IEEE International Symposium on Information Theory, Toronto, Canada, 2008.
19. R. W. Yeung, A First Course in Information Theory, Kluwer, 2002.
20. L. Ying, R. Srikant, and G. E. Dullerud, "Distributed Symmetric function computation in noisy wireless sensor networks," IEEE Transactions on Information Theory, vol. 53, no. 12, pp. 4826-4833, Dec. 2007. In the proceedings of the Forty-Sixth Annual Allerton Conference on Communication, Control, and Computing, held September 23 - September 26, 2008 in Monticello, Illinois