The encoding complexity of network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1987-1991

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC CODING NETWORK; ENCODING NODES; MULTICAST NETWORK CODING;

COMPUTATIONAL COMPLEXITY; MULTICASTING; SIGNAL ENCODING; TELECOMMUNICATION LINKS;

TELECOMMUNICATION NETWORKS;

EID: 33749437733     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523693     Document Type: Conference Paper

References (13)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network Information Flow. IEEE Transactions on Information Theory, 46(4): 1204-1216, 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear Network Coding. IEEE Transactions on Information Theory, 49(2):371-381, 2003.
3. R. Koetter and M. Medard. An Algebraic Approach to Network Coding. IEEE/ACM Transactions on Networking, 11(5):782-795, 2003.
4. T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros. The Benefits of Coding over Routing in a Randomized Setting. In Proceedings of the IEEE International Symposium on Information Theory, 2003.
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. Submitted to IEEE Transactions on Information Theory, 2003.
6. C. Fragouli, E. Soljanin, and A. Shokrollahi. Network Coding as a Coloring Problem. In Proceedings of CISS, 2004.
7. C. Fragouli and E. Soljanin. Information Flow Decomposition for Network Coding. Submitted to IEEE Transactions on Information Theory, 2004.
8. A. Tavory, M. Feder, and D. Ron. Bounds on Linear Codes for Network Multicast. Electronic Colloquium on Computational Complexity (ECCC), 10(033), 2003.
9. Y. Wu, K. Jain, and S.Y Kung. A Unification of Monger's and Edmonds' Graph Theorems and Aslswede et al's Network Coding Theorem. Allerton Conference on Communications, Control, and Computing, 2004.
10. M. Langberg, A. Sprintson, and J. Bruck. The Encoding Complexity of Network Coding. ETR063, California Institute of Technology, November, 2004. Available from: http://www.paradise.caltech.edu/ETR.html.
11. M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, San Francisco, CA, USA, 1979.
12. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Networks Flows. Prentice-Hall, NJ, USA, 1993.
13. Matthew Cook. Private communication. 2004.