The encoding complexity of network coding

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2386-2397

  Langberg, Michael ^a   Sprintson, Alexander ^b   Bruck, Jehoshua ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Texas AandM University   (United States)

Author keywords

Coding networks; Encoding links; Encoding nodes; Multicast; Network coding

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; ENCODING (SYMBOLS); FEEDBACK; PACKET NETWORKS; TELECOMMUNICATION LINKS;

ENCODING COMPLEXITY; ENCODING LINKS; ENCODING NODES; MULTICAST NETWORK CODING PROBLEM; NETWORK CODING;

TELECOMMUNICATION NETWORKS;

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

References (14)

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. 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.
3. 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.
4. 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, Yokohama, Japan, Jun./Jul. 2003, p. 442.
5. 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. Inf, Theory, to be published.
6. C. Fragouli, E. Soljanin, and A. Shokrollahi, "Network coding as a coloring problem," in Proc. Conf. Information Science and Systems, Princeton, NJ, Mar. 2004.
7. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 829-848, Mar. 2006.
8. A. Tavory, M. Feder, and D. Ron, "Bounds on linear codes for network multicast," in Proc. Electronic Colloquium on Computational Complexity (ECCC), vol. 10, 2003.
9. Y. Wu, K. Jain, and S. Y. Kung, "A unification of Menger's and Edmonds' graph theorems and Aslswede et al's network coding theorem," in Proc. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2004.
10. M. R. Garey and D. S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
11. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks Flows. Englewood Cliffs, NJ: Prentice-Hall, 1993.
12. K. Menger, "Zur allgemeinen Kurventheorie," Fund. Math., vol. 10, pp. 95-115, 1927.
13. S. Fortune, J. Hopcroft, and J. Wyllie, "The directed subgraph homeomorphism problem," Theor. Comp. Sci., vol. 10, no. 2, pp. 111-121, 1980.
14. J. Cheriyan and M. R. Salavatipour, "Hardness and approximation results for packing Steiner trees," in Proc. Europ. Symp. Algorithms (ESA 2004), Sep. 2004.