Network coding fundamentals

Foundations and Trends in Networking

Volumn 2, Issue 1, 2007, Pages 1-133

  Fragouli, Christina ^a   Soljanin, Emina ^b  

^a EPFL   (Switzerland)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; REAL TIME SYSTEMS; THROUGHPUT; TIME DELAY;

DEPLOY NETWORKS; NETWORK CODING; REAL NETWORKS;

CODES (SYMBOLS);

EID: 34347246347     PISSN: 1554057X     EISSN: 15540588     Source Type: Journal    
DOI: 10.1561/1300000003     Document Type: Article

References (50)

1. A. Agarwal and M. Charikar, "On the advantage of network coding for improving network throughput," IEEE Information Theory Workshop, San Antonio, Texas, 2004.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Transactions on Information Theory, vol. 46, pp. 1204-1216, July 2000.
3. A. H. Ali, J. W. P. Hirschfeld, and H. Kaneta, "On the size of arcs in projective spaces," IEEE Transaction on Information Theory, vol. 41, pp. 1649-1656, September 1995.
4. M. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, "Network Models," in Handbooks in Operations Research and Management Science, North Holland, 1994.
5. J. Bang-Jensen, A. Frank, and B. Jackson, "Preserving and increasing local edge-connectivity in mixed graphs," SIAM Journal on Discrete Mathematics, vol. 8, pp. 155-178, 1995.
6. A. M. Barbero and O. Ytrehus, "Heuristic, algorithms for small field multicast encoding," 2006 IEEE International Symposium Information Theory (ISIT'06), Chengdu, China, October 2006.
7. A. M. Barbero and O. Ytrehus, "Cycle-logical treatment for cyclopathic networks," Joint special issue of the IEEE Transactions on Information Theory and the IEEE/ACM Transaction on Networking, vol. 52, pp. 2795-2804, June 2006.
8. B. Bollobás, Modern Graph Theory. Springer-Verlag, 2002.
9. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. Amsterdam: North-Holland, 1979.
10. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, March 2004.
11. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity," IEEE Transactions on Information Theory, vol. 52, no. 3, pp. 777-788, March 2006.
12. J. Cannons and K. Zeger, "Network coding capacity with a constrained number of coding nodes," Allerton Conference on Communication, Control, and Computing Allerton Park, Illinois, September 2006.
13. Y. Cassuto and J. Brück, "Network coding for non-uniform demands," 2005 IEEE International Symposium Information Theory (ISIT 2005), Adelaide, Australia, September 2005.
14. C. Chekuri, C. Fragouli, and E. Soljanin, "On achievable information rates in single-source non-uniform demand networks," IEEE International Symposium on Information Theory, July 2006.
15. C. Chekuri, C. Fragouli, and E. Soljanin, "On average throughput benefits and alphabet size for network coding," Joint Special, Issue of the IEEE Transactions on Information Theory and the IEEE/A CM Transactions on Networking, vol. 52, pp. 2410-2424, June 2006.
16. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," Allerton Conference on Communication, Control, and Computing, Monticello, IL, October 2003.
17. T. M. Cover and J. A. Thomas, Elements of Information Theory. John Wiley & Sons, New York, 1991.
18. R. Diestel, Graph Theory. Springer-Verlag, 2000.
19. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Transactions on Information Theory, vol. 51, no. 8, pp. 2745-2759, August 2005.
20. P. Elias, A. Feinstein, and C. E. Shannon, "Note on maximum flow through a network," IRE Transaction on Information Theory, vol. 2, pp. 117-119, 1956.
21. E. Erez and M. Feder, "Convolutional network codes," IEEE International Symposium on Information Theory (ISIT), Chicago 2004.
22. L. R. Ford Jr. and D. R. Fulkerson, "Maximal flow through a network," Canadian Journal of Mathematics, vol. 8, pp. 399-404, 1956.
23. C. Fragouli and E. Soljanin, "A connection between network coding and convolutional codes," IEEE International Conference on Communications (ICC), vol. 2, pp. 661-666, June 2004.
24. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Transactions on Information Theory, vol. 52, pp. 829-848, March 2006.
25. N. Harvey, "Deterministic network coding by matrix completion," MS Thesis, 2005.
26. T. Ho, R. Kötter, M. Médard, M. Effros, J. Shi, and D. Karger, "A random linear network coding approach to multicast," IEEE Transactions on Information Theory, vol. 52, pp. 4413-4430, October 2006.
27. T. Ho, B. Leong, R. Kötter, and M. Médard, "Distributed Asynchronous Algorithms for Multicast Network Coding," 1st Workshop on Network Coding, WiOpt 2005.
28. S. Jaggi, Y. Cassuto, and M. Effros, "Low complexity encoding for network codes," in Proceedings of 2006 IEEE International Symposium Information Theory (ISIT'06), Seattle, USA, July 2006.
29. S. Jaggi, P. A. Chou, and K. Jain, "Low complexity algebraic network multicast codes," presented at ISIT 2008, Yokohama, Japan.
30. S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Transaction on Information Theory, vol. 51, no. 6, no. 6, pp. 1973-1982, 2005.
31. M. Kim, C. W. Ahn, M. Médard, and M. Effros, "On minimizing network coding resources: An evolutionary approach," Network Coding Workshop, 2006.
32. R. Kötter and M. Médard, "Beyond routing: An algebraic approach to network coding," IEEE/ACM Transaction on Networking, vol. 11, pp. 782-796, October 2003.
33. G. Kramer and S. Savari, "Cut sets and information flow in networks of two-way channels," in Proceedings of 2004 IEEE International Symposium Information Theory (ISIT 2004), Chicago, USA, June 27-July 2 2004.
34. M. Langberg, A. Sprintson, and J. Brück, "The encoding complexity of network coding," Joint special issue of the IEEE Transactions on Information Theory and the IEEE/ACM Transaction on Networking, vol. 52, pp. 2386-2397, 2006.
35. A. R. Lehman and E. Lehman, "Complexity classification of network information flow problems," SODA, 2004.
36. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Transactions on Information Theory, vol. 49, pp. 371-381, February 2003.
37. Z. Li, B. Li, and L. C. Lau, "On achieving optimal multicast throughput in undirected networks," in Joint Special Issue on Networking and Information Theory, IEEE Transactions on Information Theory (IT) and IEEE/ACM Transactions on Networking (TON), vol. 52, June 2006.
38. D. S. Lun, N. Ratnakar, M. Médard, R. Kötter, D. R. Karger, T. Ho, E. Ahmed, and F. Zhao, "Minimum-cost multicast over coded packet networks," IEEE Transactions on Information Theory, vol. 52, pp. 2608-2623, June 2006.
39. R. J. McEliece, "The algebraic theory of convolutional codes," in Handbook of Coding Theory, (V. Pless and W. C. Huffman, eds.), North Holland, October 1998.
40. K. Menger, "Zur allgemeinen Kurventheorie," Fundamenta Mathematicae, vol. 10, pp. 95-115, 1927.
41. A. Rasala,-Lehman and E. Lehman, "Complexity classification of network information flow problems," SODA, pp. 142-150, 2004.
42. S. Riis, "Linear versus nonlinear boolean functions in network flow," in Proceedings of 38th Annual Conference on Information Sciences and Systems (CISS'04), Princeton, NJ, March 2004.
43. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proceedings of 15th ACM Symposium on Parallel Algorithms and Architectures, 2003.
44. A. Schrijver, Theory of Linear and Integer Programming. John Wiley & Sons, June 1998.
45. J. T. Schwartz, "Fast probabilistic algorithms for verification of polynomial identities," Journal of the ACM, vol. 27, pp. 701-717, 1980.
46. J. von zur Gathen and J. Gerhard, Modern Computer Algebra. Cambridge Univ. Press, Second Edition, September 2003.
47. Y. Wu, P. A. Chou, and K. Jain, "A comparison of network coding and tree packing," ISIT 2004, 2004.
48. R. W. Yeung, "Multilevel diversity coding with distortion," IEEE Transaction on Information Theory, vol. 41, pp. 412-422, 1995.
49. R. W. Yeung, S.-Y. R.. Li, N. Cai, and Z. Zhang, "Network coding theory: A tutorial," Foundation and Trends in Communications and Information Theory, vol. 2, pp. 241-381, 2006.
50. L. Zosin and S. Khuller, "On directed Steiner trees," in Proceedings of the 13th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 59-63, 2002.