Polynomial-time construction of linear network coding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 271-282

  Iwama, Kazuo ^a   Nishimura, Harumichi ^b   Paterson, Mike ^c   Raymond, Rudy ^d   Yamashita, Shigeru ^e  

^a KYOTO UNIVERSITY   (Japan)

^b Osaka Prefecture University   (Japan)

^c UNIVERSITY OF WARWICK   (United Kingdom)

^d IBM JAPAN LTD   (Japan)

^e NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; PROGRAMMING THEORY; STANDARDS; TRANSLATION (LANGUAGES);

FINITE FIELDS; LINEAR OPERATIONS; NETWORK CODING; NP-HARD; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SOURCE-SINK; STANDARD PROBLEMS;

POLYNOMIALS;

EID: 49049090160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_23     Document Type: Conference Paper

References (23)

1. Adler, M., Harvey, N.J., Jain, K., Kleinberg, R.D., Lehman, A.R.: On the capacity of information networks. In: Proc. 17th ACM-SIAM SODA, pp. 241-250 (2006)
2. Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Transactions on Information Theory 46, 1204-1216 (2000)
3. Dougherty, R., Freiling, C., Zeger, K.: Insufficiency of linear coding in network information flow. IEEE Transactions on Information Theory 51, 2745-2759 (2005)
4. Dougherty, R., Zeger, K.: Nonreversibility and equivalent constructions of multipleunicast networks. IEEE Transactions on Information Theory 52, 5067-5077 (2006)
5. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 111-121 (1980)
6. Fragouli, C., Soljanin, E.: Information flow decomposition for network coding. IEEE Transactions on Information Theory 52, 829-848 (2006)
7. Harvey, N.J., Karger, D.R., Murota, K.: Deterministic network coding by matrix completion. In: Proc. 16th ACM-SIAM SODA, pp. 489-498 (2005)
8. Harvey, N.J., Kleinberg, R.D., Lehman, A.R.: Comparing network coding with multicommodity flow for the k-pairs communication problem. MIT LCS Technical Report 964 (September 2004)
9. Ho, T., Karger, D.R., Médard, M., Koetter, R.: Network coding from a network flow perspective. In: Proc. IEEE International Symposium on Information Theory (2003)
10. Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Egner, S., Jain, K., Tolhuizen, L.M.G.M.: Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory 51, 1973-1982 (2005)
11. Koetter, R.: Network coding home page, http://tesla.csl.uiuc.edu/ ~koetter/NWC/
12. Koetter, R., Médard, M.: Beyond routing: An algebraic approach to network coding. In: Proc. 21st Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 122-130 (2002)
13. Langberg, M., Sprintson, A., Bruck, J.: Network coding: A computational perspective. In: Proc. 40th Conference on Information Sciences and Systems (2006)
14. Langberg, M., Sprintson, A., Bruck, J.: The encoding complexity of network coding. IEEE Transactions on Information Theory 52, 2386-2397 (2006)
15. Lehman, A.R.: Network Coding. PhD thesis. MIT, Cambridge (2005)
16. Lehman, A.R., Lehman, E.: Complexity classification of network information flow problems. In: Proc. 15th ACM-SIAM SODA, pp. 142-150 (2004)
17. Lehman, A.R., Lehman, E.: Network coding: Does the model need tuning? In: Proc. 16th ACM-SIAM SODA, pp. 499-504 (2005)
18. Li, S.-Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Transactions on Information Theory 49, 371-381 (2003)
19. Médard, M., Effros, M., Ho, T., Karger, D.: On coding for non-multicast networks. In: Proc. 41st Annual Allerton Conference on Communication, Control and Computing (2003)
20. Slivkins, A.: Parameterized tractability of edge-disjoint paths on directed acyclic graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 482-493. Springer, Heidelberg (2003)
21. Tavory, A., Feder, M., Ron, D.: Bounds on linear codes for network multicast. ECCC Technical Report 33 (2003)
22. Wang, C.-C., Shroff, N.B.: Beyond the butterfly - A graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions. In: Proc. IEEE International Symposium on Information Theory (2007)
23. Wang, C.-C., Shroff, N.B.: Intersession network coding for two simple multicast sessions. In: Proc. 45th Annual Allerton Conference on Communication, Control and Computing (2007)