Network coding: An introduction

Network Coding: An Introduction

Volumn 9780521873109, Issue , 2008, Pages 1-170

  Ho, Tracey ^a   Lun, Desmond ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b BROAD INSTITUTE OF MIT AND HARVARD   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); STUDENTS;

BASIC CONCEPTS; COMMUNICATIONS INDUSTRY; COMMUNICATIONS NETWORKS; COMPUTER ENGINEERING; GRADUATE STUDENTS; LOSSLESS NETWORKS; SELECTION ALGORITHM; WIRELESS NETWORKING;

NETWORK CODING;

EID: 84924743077     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511754623     Document Type: Book

References (151)

1. S. Acedański, S. Deb, M. Médard, and R. Koetter, “How good is random linear coding based distributed networked storage?” in Proc. WINMEE, RAWNET and NETCOD 2005 Workshops, Riva del Garda, Italy, Apr. 2005.
2. A. Agarwal and M. Charikar, “On the advantage of network coding for improving network throughput,” in Proc. 2004 IEEE Information Theory Workshop (ITW 2004), San Antonio, TX, Oct. 2004, pp. 247–249.
3. R. Ahlswede, N. Cai, S.-Y. R. Li, and R.W. Yeung, “Network information flow,” IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1204–1216, July 2000.
4. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, NJ: Prentice Hall, 1993.
5. B. Awerbuch and T. Leighton, “A simple local-control approximation algorithm for multicommodity flow,” in Proc. 34th Annu. IEEE Symp. Foundations of Computer Science, Palo Alto, CA, Nov. 1993, pp. 459–468.
6. B. Awerbuch and T. Leighton, “Improved approximation algorithms for the multicommodity flow problem and local competitive routing in dynamic networks,” in STOC ’94: Proc. 26th Ann. ACM Symp. Theory of Computing, Montreal, QC, Canada, May 1994, pp. 487–496.
7. D. P. Bertsekas, “A class of optimal routing algorithms for communication networks,” in Proc. 5th Int. Conf. Computer Communication (ICCC ’80), Atlanta, GA, Oct. 1980, pp. 71–76.
8. D. P. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995.
9. D. P. Bertsekas, NetworkOptimization: Continuous and DiscreteModels. Belmont, MA: Athena Scientific, 1998.
10. D. P. Bertsekas, E. M. Gafni, and R. G. Gallager, “Second derivative algorithms for minimum delay distributed routing in networks,” IEEE Trans. Commun., vol. 32, no. 8, pp. 911–919, Aug. 1984.
11. D. P. Bertsekas and R. Gallager, Data Networks, 2nd ed. Upper Saddle River, NJ: Prentice Hall, 1992.
12. D. P. Bertsekas, A. Nedic, and A. E. Ozdaglar, Convex Analysis and Optimization. Belmont, MA: Athena Scientific, 2003.
13. D. Bertsimas, I. C. Paschalidis, and J. Tsitsiklis, “On the large deviations behavior of acyclic networks of G/G/1 queues,” Ann. Appl. Probab., vol. 8, no. 4, pp. 1027–1069, Nov. 1998.
14. S. Bhadra, S. Shakkottai, and P. Gupta, “Min-cost selfish multicast with network coding,” IEEE Trans. Inform. Theory, vol. 52, no. 11, pp. 5077–5087, Nov. 2006.
15. K. Bhattad and K. R. Nayayanan, “Weakly secure network coding,” in Proc. WINMEE, RAWNET and NETCOD 2005 Workshops, Riva del Garda, Italy, Apr. 2005.
16. K. Bhattad, N. Ratnakar, R. Koetter, and K. R. Narayanan, “Minimal network coding for multicast,” in Proc. 2005 IEEE Int. Symp. Information Theory (ISIT 2005), Adelaide, Australia, Sept. 2005, pp. 1730–1734.
17. J.W. Byers, M. Luby, and M. Mitzenmacher, “Adigital fountain approach to asynchronous reliable multicast,” IEEE J. Select. Areas Commun., vol. 20, no. 8, pp. 1528–1540, Oct. 2002.
18. N. Cai and R.W. Yeung, “Secure network coding,” in Proc. 2002 IEEE Int. Symp. Information Theory (ISIT 2002), Lausanne, Switzerland, June/July 2002, p. 323.
19. N. Cai and R.W. Yeung, “Network error correction, part II: Lower bounds,” Commun. Inf. Syst., vol. 6, no. 1, pp. 37–54, 2006.
20. T. H. Chan, “On the optimality of group network codes,” in Proc. 2005 IEEE Int. Symp. Information Theory (ISIT 2005), Adelaide, Australia, Sept. 2005, pp. 1992–1996.
21. D. Charles, K. Jain, and K. Lauter, “Signatures for network coding,” in Proc. 2006 Conf. Information Sciences and Systems (CISS 2006), Princeton, NJ, Mar. 2006, invited paper.
22. C. Chekuri, C. Fragouli, and E. Soljanin, “On average throughput and alphabet size in network coding,” IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2410–2424, June 2006.
23. H. Chen and A. Mandelbaum, “Discrete flow networks: Bottleneck analysis and fluid approximations,” Math. Oper. Res, vol. 16, no. 2, pp. 408–446, May 1991.
24. H. Chen and D. D. Yao, Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization, ser. Applications of Mathematics. New York, NY: Springer, 2001, vol. 46.
25. L. Chen, T. Ho, S. H- Low, M. Chiang & J. C. Doyle, “Optimization based rate control for multicast with network coding.” in Proc. IEEE INFOCOM 2007, Ancharage, AK, May 2007.
26. P. A. Chou, Y. Wu, and K. Jain, “Practical network coding,” in Proc. 41st Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
27. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY: John Wiley & Sons, 1991.
28. R. L. Cruz and A. V. Santhanam, “Optimal routing, link scheduling and power control inmulti-hop wireless networks,” in Proc. IEEE INFOCOM 2003, vol. 1, San Francisco, CA, Mar./Apr. 2003, pp. 702–711.
29. I. Csiszár, “Linear codes for sources and source networks: Error exponents, universal coding,” IEEE Trans. Inform. Theory, vol. 28, no. 4, pp. 585–592, July 1982.
30. Y. Cui, Y. Xue, and K. Nahrstedt, “Optimal distributed multicast routing using network coding: Theory and applications,” SIGMETRICS Perform. Eval. Rev., vol. 32, no. 2, pp. 47–49, Sept. 2004.
31. A. F. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros, “Capacity of wireless erasure networks,” IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 789–804, Mar. 2006.
32. S. Deb, M. Médard, and C. Choute, “Algebraic gossip: A network coding approach to optimal multiple rumor mongering,” IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2486–2507, June 2006.
33. S. Deb and R. Srikant, “Congestion control for fair resource allocation in networks with multicast flows,” IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 274–285, Apr. 2004.
34. R. Dougherty, C. Freiling, and K. Zeger, “Insufficiency of linear coding in network information flow,” IEEE Trans. Inform. Theory, vol. 51, no. 8, pp. 2745–2759, Aug. 2005.
35. R. Dougherty, C. Freiling, and K. Zeger, “Networks, matroids, and non-Shannon information inequalities,” IEEE Trans. Inform. Theory, vol. 53, no. 6, pp. 1949–1969, June 2007.
36. R. Dougherty and K. Zeger, “Nonreversibility and equivalent constructions of multiple-unicast networks,” IEEE Trans. Inform. Theory, vol. 52, no. 11, pp. 5067–5077, Nov. 2006.
37. M. Effros, T. Ho, and S. Kim, “A tiling approach to network code design forwireless networks,” in Proc. 2006 IEEE Information TheoryWorkshop (ITW 2006), Punta del Este, Uruguay, Mar. 2006, pp. 62–66.
38. E. Erez and M. Feder, “Convolutional network codes,” in Proc. 2004 IEEE Int. Symp. Information Theory (ISIT 2004), Chicago, IL, June/July 2004, p. 146.
39. E. Erez and M. Feder, “Convolutional network codes for cyclic networks,” in Proc. WINMEE, RAWNET and NETCOD 2005 Workshops, Riva del Garda, Italy, Apr. 2005.
40. A. Eryilmaz and D. S. Lun, “Control for inter-session network coding,” in Proc. 2007 Information Theory and Applications Workshop (ITA 2007), San Diego, CA, Jan./Feb. 2007.
41. M. Feder, D. Ron, and A. Tavory, “Bounds on linear codes for network multicast,” ElectronicColloquium on ComputationalComplexity, Report TR03-033, May 2003.
42. J. Feldman, T. Malkin, C. Stein, and R. A. Servedio, “On the capacity of secure network coding,” in Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept./Oct. 2004.
43. C. Fragouli and E. Soljanin, “A connection between network coding and convolutional codes,” in Proc. 2004 IEEE Int. Conf. Communications (ICC 2004), vol. 2, Paris, France, June 2004, pp. 661–666.
44. C. Fragouli and E. Soljanin, “Information flow decomposition for network coding,” IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 829–848, Mar. 2006.
45. C. Fragouli and E. Soljanin, “Network coding fundamentals.” Foundations and Trends in Networking, vol. 2, no. 1, 2007.
46. C. Fragouli and E. Soljanin, “Network coding application,” Foundations and Trends in Networking, to appear.
47. S. Ghez, S. Verdú, and S. C. Schwartz, “Stability properties of slotted Aloha with multipacket reception capability,” IEEE Trans. Automat. Contr., vol. 33, no. 7, pp. 640–649, July 1988.
48. E. N. Gilbert, “A comparison of signaling alphabets,” Bell Syst. Tech. J., vol. 31, pp. 504–522, May 1952.
49. C. Gkantsidis and P. R. Rodriguez, “Network coding for large scale content distribution,” in Proc. IEEE INFOCOM 2005, vol. 4, Miami, FL, Mar. 2005, pp. 2235–2245.
50. R. Gowaikar, A. F. Dana, R. Palanki, B. Hassibi, and M. Effros, “On the capacity of wireless erasure networks,” in Proc. 2004 IEEE Int. Symp. Information Theory (ISIT 2004), Chicago, IL, June/July 2004, p. 401.
51. T. S. Han, “Slepian-Wolf-Cover theorem for networks of channels,” Inf. Control, vol. 47, pp. 67–83, 1980.
52. N. J. A. Harvey, R. Kleinberg, C. Nair, and Y. Wu, “A ’chicken & egg’ network coding problem,” in Proc. 2007 IEEE Int. Symp. Information Theory (ISIT 2007), Nice, France, June 2007.
53. N. J. A. Harvey, D. R. Karger, and K. Murota, “Deterministic network coding by matrix completion,” in SODA ’05: Proc. 16th Annu. ACMSIAM Symp. Discrete Algorithms, Jan. 2005, pp. 489–498.
54. N. J. A. Harvey, R. Kleinberg, and A. Rasala Lehman, “On the capacity of information networks,” IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2345–2364, June 2006.
55. T. Ho, “Networking from a network coding perspective,” Ph.D. dissertation, Massachusetts Institute of Technology, May 2004.
56. T. Ho, Y.-H. Chang, and K. J. Han, “On constructive network coding for multiple unicasts,” in Proc. 44th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 2006, invited paper.
57. T. Ho, D. R. Karger, M. Médard, and R. Koetter, “Network coding from a network flow perspective,” in Proc. 2003 IEEE Int. Symp. Information Theory (ISIT 2003), Yokohama, Japan, June/July 2003, p. 441.
58. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, “The benefits of coding over routing in a randomized setting,” in Proc. 2003 IEEE Int. Symp. Information Theory (ISIT 2003), Yokohama, Japan, June/July 2003, p. 442.
59. T. Ho, B. Leong, R. Koetter, M. Médard, M. Effros, and D. R. Karger, “Byzantine modification detection for multicast networks using randomized network coding,” in Proc. 2004 IEEE Int. Symp. Information Theory (ISIT 2004), Chicago, IL, June/July 2004, p. 144.
60. T. Ho, B. Leong, R. Koetter, and M. Medard, “Distributed asynchronous algorithms for multicast network coding,” in Proceedings of First Workshop on Network Coding, Theory and Applications, 2005.
61. T. Ho, M. Médard, and M. Effros, “Network coding for correlated sources,” in Proc. 2004 Conf. Information Sciences and Systems (CISS 2004), Princeton, NJ, Mar. 2004, invited paper.
62. T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, “A random linear network coding approach to multicast,” IEEE Trans. Inform. Theory, vol. 52, no. 10, pp. 4413–4430, Oct. 2006.
63. T. Ho, M. Médard, J. Shi, M. Effros, and D. R. Karger, “On randomized network coding,” in Proc. 41st Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
64. T. Ho and H. Viswanathan, “Dynamic algorithms for multicast with intra-session network coding,” IEEE Trans. Inform. Theory, submitted.
65. T. Ho and H. Viswanathan, “Dynamic algorithms for multicast with intra-session network coding,” in Proc. 43rd Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 2005.
66. S. Jaggi, P. Chou, and K. Jain, “Low complexity algebraic network codes,” in Proc. 2003 IEEE Int. Symp. Information Theory (ISIT 2003), Yokohama, Japan, June/July 2003, p. 368.
67. S. Jaggi and M. Langberg, “Resilient network coding in the presence of eavesdropping byzantine adversaries,” in Proc. 2007 IEEE Int. Symp. Information Theory (ISIT 2007), Nice, France, June 2007.
68. S. Jaggi, M. Langberg, T. Ho, and M. Effros, “Correction of adversarial errors in networks,” in Proc. 2005 IEEE International Symposium on Information Theory (ISIT 2005), Adelaide, Australia, Sept. 2005, pp. 1455–1459.
69. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Médard, “Resilient network coding in the presence of byzantine adversaries,” in Proc. IEEE INFOCOM 2007, Anchorage, AK, May 2007.
70. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. M. G. M. Tolhuizen, “Polynomial time algorithms for multicast network code construction,” IEEE Trans. Inform. Theory, vol. 51, no. 6, pp. 1973–1982, June 2005.
71. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. M. G. M. Tolhuizen, “Polynomial time algorithms for multicast network code construction,” IEEE Trans. Inform. Theory, vol. 51, no. 6, pp. 1973–1982, June 2005.
72. K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, “Impact of interference on multi-hop wireless network performance,” in MobiCom ’03: Proc. 9th Annu. Int. Conf. Mobile Computing and Networking, San Diego, CA, 2003, pp. 66–80.
73. M. Johansson, L. Xiao, and S. Boyd, “Simultaneous routing and power allocation in CDMA wireless data networks,” in Proc. 2003 IEEE Int. Conf. Communications (ICC 2003), vol. 1, Anchorage, AK, May 2003, pp. 51–55.
74. S. Katti, D. Katabi, W. Hu, H. Rahul, and M. Médard, “The importance of being opportunistic: Practical network coding for wireless environments,” in Proc. 43rd Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 2005.
75. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, “XORs in the air: Practical wireless network coding,” SIGCOMM Comput. Commun. Rev., vol. 36, no. 4, pp. 243–254, 2006.
76. F. P. Kelly, Reversibility and Stochastic Networks. Chichester: John Wiley & Sons, 1979.
77. R. Khalili and K. Salamatian, “On the capacity of erasure relay channel: Multi-relay case,” in Proc. 2005 IEEE Information Theory Workshop (ITW 2005), Rotorua, New Zealand, Aug./Sept. 2005.
78. M. Kim, M. Médard, V. Aggarwal, U.-M. O’Reilly, W. Kim, C. W. Ahn, and M. Effros, “Evolutionary approaches to minimizing network coding resources,” in Proc. IEEE INFOCOM 2007, Anchorage, AK, May 2007.
79. M. Kodialam and T. Nandagopal, “Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels,” IEEE/ACM Trans. Networking, vol. 13, no. 4, pp. 868–880, Aug. 2005.
80. R. Koetter, M. Effros, T. Ho, and M. Médard, “Network codes as codes on graphs,” in Proc. 2004 Conf. Information Sciences and Systems (CISS 2004), Princeton, NJ, Mar. 2004.
81. R. Koetter and F. R. Kschischang, “Coding for errors and erasures in random network coding,” IEEE Trans. Inform. Theory, submitted.
82. R. Koetter and M. Médard, “An algebraic approach to network coding,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782–795, Oct. 2003.
83. G. Kramer and S. A. Savari, “Progressive d-separating edge set bounds on network coding rates,” in Proc. 2005 IEEE Int. Symp. Information Theory (ISIT 2005), Adelaide, Australia, Sept. 2005, pp. 1588–1592.
84. S.-Y. R. Li and R. W. Yeung, “On convolutional network coding,” in Proc. 2006 IEEE Int. Symp. Information Theory (ISIT 2006), Seattle, WA, July 2006, pp. 1743–1747.
85. S.-Y. R. Li, R. W. Yeung, and N. Cai, “Linear network coding,” IEEE Trans. Inform. Theory, vol. 49, no. 2, pp. 371–381, Feb. 2003.
86. Z. Li and B. Li, “Network coding in undirected networks,” in Proc. 2004 Conf. Information Sciences and Systems (CISS 2004), Princeton, NJ, Mar. 2004.
87. Z. Li and B. Li, “Network coding: The case of multiple unicast sessions,” in Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept./Oct. 2004.
88. Z. Li and B. Li, “Efficient and distributed computation of maximum multicast rates,” in Proc. IEEE INFOCOM 2005, vol. 3, Miami, FL, Mar. 2005, pp. 1618–1628.
89. M. Luby, “LT codes,” in Proc. 34th Annu. IEEE Symp. Foundations of Computer Science, Vancouver, Canada, Nov. 2002, pp. 271–280.
90. D. S. Lun, “Efficient operation of coded packet networks,” Ph.D. dissertation, Massachusetts Institute of Technology, June 2006.
91. D. S. Lun, M. Médard, and M. Effros, “On coding for reliable communication over packet networks,” in Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept./Oct. 2004, invited paper.
92. D. S. Lun, M. Médard, T. Ho, and R. Koetter, “Network coding with a cost criterion,” in Proc. 2004 Int. Symp. Information Theory and its Applications (ISITA 2004), Parma, Italy, Oct. 2004, pp. 1232–1237.
93. D. S. Lun, M. Médard, and D. R. Karger, “On the dynamicmulticast problem for coded networks,” in Proc. WINMEE, RAWNET and NETCOD 2005 Workshops, Riva del Garda, Italy, Apr. 2005.
94. D. S. Lun, M. Médard, and R. Koetter, “Efficient operation of wireless packet networks using network coding,” in Proc. Int. Workshop Convergent Technologies (IWCT) 2005, Oulu, Finland, June 2005, invited paper.
95. D. S. Lun, M. Médard, R. Koetter, and M. Effros, “Further results on coding for reliable communication over packet networks,” in Proc. 2005 IEEE Int. Symp. Information Theory (ISIT 2005), Adelaide, Australia, Sept. 2005, pp. 1848–1852.
96. D. S. Lun, P. Pakzad, C. Fragouli, M. Médard, and R. Koetter, “An analysis of finite-memory random linear coding on packet streams,” in Proc. 4th Int. Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt ’06), Boston, MA, Apr. 2006.
97. D. S. Lun, N. Ratnakar, R. Koetter, M. Médard, E. Ahmed, and H. Lee, “Achieving minimum-cost multicast: A decentralized approach based on network coding,” in Proc. IEEE INFOCOM 2005, vol. 3, Miami, FL, Mar. 2005, pp. 1608–1617.
98. D. S. Lun, N. Ratnakar, M. Médard, R. Koetter, D. R. Karger, T. Ho, E. Ahmed, and F. Zhao, “Minimum-cost multicast over coded packet networks,” IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2608–2623, June 2006.
99. P. Maymounkov, “Online codes,” NYU, Technical Report TR2002-833, Nov. 2002.
100. P. Maymounkov, N. J. A. Harvey, and D. S. Lun, “Methods for efficient network coding,” in Proc. 44th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 2006.
101. M. Médard, M. Effros, T. Ho, and D. R. Karger, “On coding for nonmulticast networks,” in Proc. 41st Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
102. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge: Cambridge University Press, 1995.
103. M. Neely, E. Modiano, and C. Rohrs, “Dynamic power allocation and routing for time varying wireless networks,” IEEE J. Select. Areas Commun., vol. 23, no. 1, pp. 89–103, Jan. 2005.
104. M. J. Neely, “Dynamic Power Allocation & routing for satellite & wireless networks with time-varying channels.” PhD discertation, LIDS, MIT, Cambridge, MA 2003.
105. M. J. Neely, “Energy optimal control for time-varying wireless networks,” IEEE Trans. Inform. Theory, vol. 52, no. 7, pp. 2915–2934, July 2006.
106. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York, NY: John Wiley & Sons, 1999.
107. A. Ouorou, P. Mahey, and J.-P. Vial, “A survey of algorithms for convex multicommodity flow problems,” Manage. Sci., vol. 46, no. 1, pp. 126–147, Jan. 2000.
108. J. G. Oxley, Matroid Theory. New York, NY: Oxford University Press, 1992.
109. P. Pakzad, C. Fragouli, and A. Shokrollahi, “Coding schemes for line networks,” in Proc. 2005 IEEE Int. Symp. Information Theory (ISIT 2005), Adelaide, Australia, Sept. 2005, pp. 1853–1857.
110. J.-S. Park, M. Gerla, D. S. Lun, Y. Yi, and M. Médard, “Codecast: A network-coding-based ad hoc multicast protocol,” IEEE Wireless Commun. Mag., vol. 13, no. 5, pp. 76–81, Oct. 2006.
111. I. C. Paschalidis and Y. Liu, “Large deviations-based asymptotics for inventory control in supply chains,” Oper. Res., vol. 51, no. 3, pp. 437–60, May–June 2003.
112. A. Ramamoorthy, K. Jain, P. A. Chou, and M. Effros, “Separating distributed source coding from network coding,” IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2785–2795, June 2006.
113. S. Ramanathan, “Multicast tree generation in networks with asymmetric links,” IEEE/ACM Trans. Networking, vol. 4, no. 4, pp. 558–568, Aug. 1996.
114. A. Rasala Lehman and E. Lehman, “Complexity classification of network information flow problems,” in SODA ’04: Proc. 15th Annu. ACM-SIAM Symp. Discrete algorithms, New Orleans, LA, Jan. 2004, pp. 142–150.
115. N. Ratnakar, R. Koetter, and T. Ho, “Linear flow equations for network coding in the multiple unicast case,” in Proc. DIMACS Working Group Network Coding, Piscataway, NJ, Jan. 2005.
116. N. Ratnakar, D. Traskov, and R. Koetter, “Approaches to network coding for multiple unicasts,” in Proc. 2006 International Zurich Seminar on Communications (IZS 2006), Zurich, Switzerland, Feb. 2006, pp. 70–73, invited paper.
117. S. Riis, “Linear versus non-linear Boolean functions in network flow,” in Proc. 2004 Conf. Information Sciences and Systems (CISS 2004), Princeton, NJ, Mar. 2004.
118. J. R. Roche, R.W. Yeung, and K. P. Hau, “Symmetrical multilevel diversity coding,” IEEE Trans. Inform. Theory, vol. 43, no. 3, pp. 1059–1064, May 1997.
119. Y. E. Sagduyu and A. Ephremides, “Crosslayer design and distributed MAC and network coding in wireless ad hoc networks,” in Proc. 2005 IEEE Int. Symp. Information Theory (ISIT 2005), Adelaide, Australia, Sept. 2005, pp. 1863–1867.
120. Y. E. Sagduyu and A. Ephremides, “Joint scheduling and wireless network coding,” in Proc. WINMEE, RAWNET and NETCOD 2005 Workshops, Riva del Garda, Italy, Apr. 2005.
121. P. Sanders, S. Egner, and L. Tolhuizen, “Polynomial time algorithms for network information flow,” in SPAA ’03: Proc. 15th Annu. ACM Symp. Parallel Algorithms and Architectures, San Diego, CA, June 2003, pp. 286–294.
122. S. Sengupta, S. Rayanchu, and S. Banerjee, “An analysis of wireless network coding for unicast sessions: The case for coding-aware routing,” in Proc. IEEE INFOCOM 2007, Anchorage, AK, May 2007.
123. H. D. Sherali and G. Choi, “Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs,” Oper. Res. Lett., vol. 19, pp. 105–113, 1996.
124. A. Shokrollahi, “Raptor codes,” IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2551–2567, June 2006.
125. N. Shulman, “Communication over an unknown channel via common broadcasting,” Ph.D. dissertation, Tel Aviv University, July 2003.
126. N. Shulman and M. Feder, “Static broadcasting,” in Proc. 2000 IEEE Int. Symp. Information Theory (ISIT 2000), Sorrento, Italy, June 2000, p. 23.
127. R. Srikant, The Mathematics of Internet Congestion Control. Boston, MA: Brikhäuser, 2004.
128. J. Tan and M. Médard, “Secure network coding with a cost criterion,” in Proc. 4th Int. Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt ’06), Boston, MA, Apr. 2006.
129. L. Tassiulas and A. F. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” IEEE Trans. Automat. Contr., vol. 37, no. 12, pp. 1936–1948, Dec. 1992.
130. D. Traskov, N. Ratnakar, D. S. Lun, R. Koetter, and M. Médard, “Network coding for multiple unicasts: An approach based on linear optimization,” in Proc. 2006 IEEE Int. Symp. Information Theory (ISIT 2006), Seattle, WA, July 2006, pp. 1758–1762.
131. J. N. Tsitsiklis, “Decentralized detection,” in Advances in Statistical Signal Processing. Greenwich, CT: JAI Press, 1993, vol. 2, pp. 297–344.
132. E. C. van der Meulen, “Three-terminal communication channels,” Adv. Appl. Probab., vol. 3, pp. 120–154, 1971.
133. R. R. Varshamov, “Estimate of the number of signals in error-correcting codes,” Dokl. Acad. Nauk SSSR, vol. 117, pp. 739–741, 1957.
134. Y. Wu, “A trellis connectivity analysis of random linear network coding with buffering,” in Proc. 2006 IEEE Int. Symp. Information Theory (ISIT 2006), Seattle, WA, July 2006, pp. 768–772.
135. Y. Wu, M. Chiang, and S.-Y. Kung, “Distributed utility maximization for network coding based multicasting: A critical cut approach,” in Proc. 4th Int. Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt ’06), Boston, MA, Apr. 2006.
136. Y. Wu, P. A. Chou, and S.-Y. Kung, “Information exchange in wireless networks with network coding and physical-layer broadcast,” in Proc. 2005 Conf. Information Sciences and Systems (CISS 2005), Baltimore, MD, Mar. 2005.
137. Y. Wu, P. A. Chou, and S.-Y. Kung, “Minimum-energy multicast in mobile ad hoc networks using network coding,” IEEE Trans. Commun., vol. 53, no. 11, pp. 1906–1918, Nov. 2005.
138. Y. Wu, P. A. Chou, Q. Zhang, K. Jain, W. Zhu, and S.-Y. Kung, “Network planning in wireless ad hoc networks: A cross-layer approach,” IEEE J. Select. Areas Commun., vol. 23, no. 1, pp. 136–150, Jan. 2005.
139. Y. Xi and E.M. Yeh, “Distributed algorithms forminimum cost multicast with network coding,” in Proc. 43rd Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sept. 2005.
140. Y. Xi and E.M. Yeh, “Distributed algorithms for minimum cost multicast with network coding in wireless networks,” in Proc. 4th Int. Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt ’06), Boston, MA, Apr. 2006.
141. L. Xiao, M. Johansson, and S. Boyd, “Simultaneous routing and resource allocation via dual decomposition,” IEEE Trans. Commun., vol. 52, no. 7, pp. 1136–1144, July 2004.
142. X. Yan, R.W. Yeung, and Z. Zhang, “The capacity region formulti-source multi-sink network coding,” in Proc. 2007 IEEE Int. Symp. Information Theory (ISIT 2007), Nice, France, June 2007.
143. R. W. Yeung, “Multilevel diversity coding with distortion,” IEEE Trans. Inform. Theory, vol. 41, no. 2, pp. 412–422, Mar. 1995.
144. R. W. Yeung, A First Course in Information Theory. New York, NY: Kluwer Academic/Plenum, 2002.
145. R.W. Yeung and N. Cai, “Network error correction, part I: Basic concepts and upper bounds,” Commun. Inf. Syst., vol. 6, no. 1, pp. 19–36, 2006.
146. R.W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, “Network coding theory: Part I: Single source,” Foundations and Trends in Communications and Information Theory, vol. 2, no. 4, 2005.
147. R.W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, “Network coding theory: Part II: Multiple sources,” Foundations and Trends in Communications and Information Theory, vol. 2, no. 5, 2005.
148. R.W. Yeung and Z. Zhang, “Distributed source coding for satellite communications,” IEEE Trans. Inform. Theory, vol. 45, no. 4, pp. 1111–1120, May 1999.
149. R.W. Yeung and Z. Zhang, “On symmetrical multilevel diversity coding,” IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 609–621, Mar. 1999.
150. F. Zhao, T. Kalker, M. Medard, and K. J. Han, “Signatures for content distribution with network coding,” in Proc. 2007 IEEE Int. Symp. Information Theory (ISIT 2007), Nice, France, June 2007.
151. L. Zosin and S. Khuller, “On directed Steiner trees,” in SODA ’02: Proc. 13th Annu. ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, Jan. 2002, pp. 59–63.