Approaches to network coding for multiple unicasts

International Zurich Seminar on Digital Communications

Volumn 2006, Issue , 2006, Pages 70-73

  Ratnakar, Niranjan ^a   Traskov, Danail ^a   Koetter, Ralf ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC FORMULATION; LINEAR OPTIMIZATION; NETWORK CODES; NETWORK CODING;

ALGEBRA; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; NETWORK PROTOCOLS; OPTIMIZATION; STATE SPACE METHODS;

SIGNAL ENCODING;

EID: 33845580471     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IZS.2006.1649081     Document Type: Conference Paper

References (19)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow", IEEE Trans. on Inf. Theory, vol. IT-46, pp. 1204-1216, 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding", IEEE Trans. on Inf. Theory, vol. IT-49, pp. 371-381, February 2003.
3. A. Ouorou, P. Mahey, and J.P. Vial, "A survey of algorithms for convex multicommodity flow problems", Management Science, vol. 46, no. 1, pp. 126-147, October 2000.
4. C. Chekuri, S. Khanna, and F.B. Shepherd, "The all-or-nothing multicommodity flow problem", Proceedings of the 36th Annual ACM Symp. on Theory of Computing, Chicago, IL, pp. 156-165, 2004.
5. M. Medard, M. Effros, T. Ho, and D. Karger, "On coding for nonmulticast networks", in Allerton Conference on Communication, Control, and Computing, 2003.
6. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow", IEEE Trans. on Inf. Theory, Submitted.
7. R.W. Yeung, S.-Y.R. Li, N. Cai, Z. Zhang, "Theory of Network Coding," submitted to Foundations and Trends in Communications and Inf. Theory.
8. T. Chan, "On the optimality of group network codes", IEEE Int. Symp. on Inf. Theory, Adelaide, 2005.
9. April Rasala Lehman and Eric Lehman, "Complexity classification of network information flow problems", in SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, 2004, pp. 142-150,
10. R. Koetter and M. Medard, "An algebraic approach to network coding", IEEE/ACM Trans. on networking, vol. 11, no. 5, October 2003.
11. S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction", Submitted to IEEE Trans. Inf. Theory, 2003.
12. T. Ho, R. Koetter, M. Medard, M. Effros, J. Shi, and D. Karger, "Toward a random operation of networks", IEEE Trans. Inf. Theory, Submitted.
13. N. Harvey, R. Kleinberg, A. Lehman, "Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem." MIT LCS Technical Report 964. Sept. 28th, 2004.
14. S. Katti, D. Katabi, Wenjun Hu, and Rahul Hariharan, "The importance of being opportunistic: Practical network coding for wireless environments", in Allerton Conference on Communication, Control, and Computing, 2005.
15. A. Dickenstein, I. Emiris, Solving Polynomial Equations, Foundations, Algorithms, and Applications Series: Algorithms and Computation in Mathematics, Vol. 14, Springer
16. R. Koetter, "On the Representation of Codes in Forney Graphs", Festschrift to the 60th birthday of G.D. Forney, 2001
17. G. D. Forney, Jr., "Codes on graphs: normal realizations" IEEE Trans. Inf. Theory, vol. 47, no. 2, 2001
18. R. Koetter, M. Effros, T. Ho, M. Medard, "Network Codes as Codes on Graphs", preprint, 2004
19. N. Ratnakar, D. Traskov, R. Koetter, "Network coding for multiple unicasts: an approach based on linear optimization", In preparation, 2006