Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory

Volumn 51, Issue 6, 2005, Pages 1973-1982

  Jaggi, Sidharth ^a   Sanders, Peter ^b   Chou, Philip A ^c   Effros, Michelle ^a   Egner, Sebastian ^d   Jain, Kamal ^c   Tolhuizen, Ludo M G M ^d  

^a California Institute of Technology   (United States)

^b UNIVERSITY OF KARLSRUHE   (Germany)

^c MICROSOFT RESEARCH   (United States)

^d PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Communication networks; Efficient algorithms; Linear coding; Multicasting rate maximization

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS;

DIRECTED ACYCLIC GRAPHS; EFFICIENT ALGORITHMS; LINEAR CODING; MULTICASTING RATE MAXIMIZATION;

MULTICASTING;

EID: 20544473127     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.847712     Document Type: Article

References (22)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. R. K. Ahuja, R. L. Magnanti, and J. B. Orlin, Network Flows. Englewood Cliffs, NJ: Prentice-Hall, 1993.
3. N. Cai and R. W. Yeung, "Network coding and error correction," in Proc. Information Theory Workshop (ITW), Bangalore, India, Oct. 2002, pp. 119-122.
4. B. Carr and S. Vempala, "Randomized meta-rounding," in Proc. 32nd ACM Symp. Theory of Computing (STOC), Portland, OR, May 2000, pp. 58-52.
5. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 41st Allerton Conf. Communication, Control and Computing, Monticello, IL, 2003.
6. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," J. Symb. Comput., vol. 9, pp. 251-280, 1990.
7. E. A. Dinic, "Algorithm for solution of a problem of maximum flow," Sov. Math. - Dokl., vol. 11, pp. 1277-1280, 1970.
8. J. Dumas, T. Gautier, and C. Pernet, "Finite field linear algebra subroutines," in Proc. Int. Symp. Symbolic and Algebraic Computation(ISSAC), Lille, France, Jul. 2002, pp. 63-74.
9. J. Edmonds, "Minimum partition of a matroid into independent sets," J. Res. Nat. Bur. Stand. Sect., vol. 869, pp. 67-72, 1965.
10. S. Even and E. Tarjan, "Network flow and testing graph connectivity," SIAM J. Comput., vol. 4, pp. 507-518, 1975.
11. T. Ho, D. Karger, R. Koetter, and M. Médard, "Network coding from a network flow perspective," in Proc. IEEE Int. Symp. Information Theory (ISIT), Yokohama, Japan, Jun./Jul. 2003, p. 441.
12. T. Ho, R. Koetter, M. Médard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE Int. Symp. Information Theory (ISIT), Yokohama, Japan, Jun./Jul. 2003, p. 442.
13. n)," IEEE Trans. Inf. Theory, vol. IT-26, no. 3, pp. 367-369, May 1980.
14. S. Jaggi, P. A. Chou, and K. Jain, "Low complexity algebraic multicast network codes," in Proc. IEEE Int. Symp. Information Theory (ISIT), Yokohama, Japan, Jun./Jul. 2003, p. 368.
15. K. Jain, M. Mahdian, and M. R. Salavatipour, "Packing Steiner trees," in Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, Jan. 2003.
16. R. Koetter and M. Médard, "Beyond routing: An algebraic approach to network coding," in Proc. 21st Annu. Joint Conf. IEEE Computer and Communications Societies (INFOCOMM), vol. 1, New York, Jun. 2002, pp. 122-130.
17. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
18. A. Rasala-Lehman and E. Lehman, "Complexity classification of network information flow problems," manuscript, Apr. 2003.
19. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
20. F. J. McWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
21. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press 1992.
22. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. 15th ACM Symp. Parallel Algorithms and Architectures (SPAA), San Diego, CA, Jun. 2003, pp. 286-294.