Network coding in minimal multicast networks

2006 IEEE Information Theory Workshop, ITW 2006

Volumn , Issue , 2006, Pages 307-311

  El Rouayheb, Salim Y ^a   Georghiades, Costas N ^a   Sprintson, Alexander ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESTINATION NODES; MULTICAST CODING NETWORK; NETWORK CODING; POLYNOMIAL TIME;

CODES (SYMBOLS); INFORMATION THEORY; MULTICASTING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

COMPUTER NETWORKS;

EID: 33751024433     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R. Diestel, "Graph Theory," Springer-Verlag New York, Inc, 1997.
2. M.C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs : Second Edition," Elsevier B. V., 2004.
3. R.L. Graham, M. Grötschel and L. Lovász, "Handbook of Combinatorics,", The MIT Press, vol. 1, 1995.
4. T. H. Cormen, C. E. Leiserson and C. Stein, "Introduction to Algorithms," The MIT Press, 2001.
5. R. Ahlswede, N. Cai, S. Y. R. Li and R. W. Yeung, "Network information flow," IEEE Trans. on Inform. Theory, vol. 46, pp. 1204-1216, 2000.
6. S.Y.R. Li, R. W. Yeung, and N. Cai, " Linear Network Coding," IEEE Trans. inform. Theory, vol. 49, p. 371, Feb. 2003.
7. T. Ho, M. Médard, J. Shi, M. Effros and D. R. Karger, "On Randomized Network Coding," 41st Annual Allerton Conference on Communication Control and Computing, Oct. 2003.
8. R. Koetter and M. Médard, " An algebraic approach to network coding," IEEE/ACM Trans. on Networking, vol. 11, NO. 5, Oct. 2003.
9. C. Fragouli, E. Soljanin, A. Shokrollahi, "Network coding as a coloring problem", Proceeding of CISS, 2004.
10. A. Rasala-Lehman and E. Lehman, "Complexity Classification of Network information Flow Problems," 41st Annual Atterton Conference on Communication Control and Computing, Oct. 2003.
11. 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 Trans. on Inform. Theory, vol. 51, pp. 1973-1982, 2005.
12. M. Langberg, A. Sprintson, and J. Bruck, "The Encoding Complexity of Network Coding," Submitted to IEEE Transactions on Information Theory.
13. K. Jain, M. Mahdian, and M.R. Salavatipour, " Packing Steiner Trees," 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
14. Y. Wu, P. A. Chou, and K. Jain, "A Comparison of Network Coding and Tree Packing," Proc. of IEEE International Symposium on Information Theory(ISIT), 2004.
15. http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/ GraphAlgor/breadthSearch.htm.