On the capacity of network coding for random networks

IEEE Transactions on Information Theory

Volumn 51, Issue 8, 2005, Pages 2878-2885

  Ramamoorthy, Aditya ^a   Shi, Jun ^a   Wesel, Richard D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Minimum cut; Multicast; Network coding; Random geometric graphs; Random graphs

Indexed keywords

APPROXIMATION THEORY; CHANNEL CAPACITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; MATHEMATICAL MODELS; MULTICASTING; PROBABILITY; RANDOM PROCESSES; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

MINIMUM CUT; NETWORK CODING; RANDOM GEOMETRIC GRAPHS; RANDOM NETWORKS;

SIGNAL ENCODING;

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

References (21)

1. R. K. Ahuja, T. L. Maganti, and J. B. Orlin, Network Flows:Theory, Algorithms and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
2. R. Ahlswede, N. Cai, S.-Y. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
3. S.-Y. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
4. 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.
5. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, submitted for publication.
6. T. Ho, R. Koetter, M. Médard, M. Effros, J. Shi, and D. Karger, "Toward a random operation of networks," IEEE Trans. Inf. Theory, submitted for publication.
7. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 41st Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
8. M. Médard, M. Effros, T. Ho, and D. Karger, "On coding for nonmulticast networks," in Proc. 41st Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
9. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005.
10. T. Ho, M. Médard, M. Effros, and R. Koetter, "Network coding for correlated sources," in Proc. Conf. Information Sciences and Systems (CISS), Princeton, NJ, Mar, 2004.
11. A. Ramamoorthy, K. Jain, P. A. Chou, and M. Effros, "Separating distributed source coding from network coding," in Proc. 42nd Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2004.
12. B. Bollobas, Random Graphs. London/New York: Academic, 1985.
13. M. Penrose, Random Geometric Graphs. Oxford, U.K.: Oxford Univ. Press, 2003.
14. G. Kramer and S. Savari, "On networks of two-way channels," in Proc. DIMACS Workshop on Algebraic Coding Theory and Information Theory, Piscataway, NJ, Dec. 2003.
15. D. R. Karger, "Random sampling in cut, flow and network design problems," Math. of Oper. Res., vol. 24, no. 2, pp. 0383-0413, 1999.
16. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
17. Y. Wu, P. A. Chou, and K. Jain, "A comparison of network coding and tree packing," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 143.
18. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
19. C. Bettstetter, "On the minimum node degree and connectivity of a wireless multihop network," in Proc. MobiHoc, Lausanne, Switzerland, 2002, pp. 80-91.
20. K. Jain, M. Mahdian, and M. R. Salavatipour, "Packing Steiner trees," in Proc. 14th Annu. ACM-SIAM Symp. Discrete Algorithms, Baltimore, MD, 2003, pp. 266-274.
21. R. Durrett, Probability: Theory and Examples, 2nd ed: Duxbury, 1995.