Network coding theory: A survey

IEEE Communications Surveys and Tutorials

Volumn 15, Issue 4, 2013, Pages 1950-1978

  Bassoli, Riccardo ^a   Marques, Hugo ^a   Rodriguez, Jonathan ^b   Shum, Kenneth W ^a   Tafazolli, Rahim ^c  

^a INSTITUTO DE TELECOMUNICAÇÕES   (Portugal)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

Capacity region; Complexity; Information theory; Network coding theory; Network error correcting (NEC) codes; Random linear network coding

Indexed keywords

CAPACITY REGIONS; COMPLEXITY; GRAPH REPRESENTATION; MATROID THEORY; NETWORK ERRORS; RANDOM LINEAR NETWORK CODING;

COMPLEX NETWORKS; COMPUTER PROGRAMMING; INFORMATION THEORY; MATRIX ALGEBRA; SURVEYS;

NETWORK CODING;

EID: 84888366210     PISSN: None     EISSN: 1553877X     Source Type: Journal    
DOI: 10.1109/SURV.2013.013013.00104     Document Type: Review

References (310)

1. C. E. Shannon, "A mathematical theory of communication," Bell system technical journal, vol. 27, 1948.
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. C. Fragouli, J.-Y. Le Boudec, and J. Widmer, "Network coding: An instant primer," in ACM SIGCOMM Computer Communication Review, 2006, vol. 36, no. 1, Jan. 2006. [Online]. Available: http://www.news.cs.nyu.edu/?jinyang/ fa07/papers/nc.pdf
4. C. Fragouli and S. Diggavi, "Foundation aspects of network coding: Report on state-of-the-art," EPFL, Tech. Rep., Jun. 2008. [Online]. Available: http://www.n-crave.eu/images/pdf/D1.1.pdf
5. M. Di Renzo, M. Iezzi, and F. Graziosi, "Beyond routing via network coding: An overview of fundamental information-theoretic results," in IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications, 2010, Sep. 2010, pp. 2745-2750.
6. M. Sanna and E. Izquierdo, "A survey of linear network coding and network error correction code constructions and algorithms," International Journal of Digital Multimedia Broadcasting, vol. 2011, May 2011.
7. A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, "A survey on network codes for distributed storage," Proc. IEEE, vol. 99, no. 3, pp. 476-489, Mar. 2011.
8. T. Matsuda, T. Noguchi, and T. Takine, "Survey of network coding and its applications," IEICE Trans. Commun., vol. E94-B, no. 3, pp. 698-717, Mar. 2011.
9. R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, Network Coding Theory. Now Publishers, 2006. [Online]. Available: http://iest2.ie.cuhk.edu.hk/?whyeung/ publications/tutorial.pdf
10. C. Fragouli and E. Soljanin, "Network coding fundamentals," Foundations and Trends in Networking, vol. 2, no. 2, pp. 1-133, 2007. [Online]. Available: http://infoscience.epfl.ch/record/142317/files/foundamentals.pdf (Pubitemid 47007533)
11. , "Network coding applications," Foundations and Trends in Networking, vol. 2, no. 2, pp. 135-269, 2007. [Online]. Available: http://arni.epfl.ch/contents/courses/monoII.pdf
12. P. A. Chou and Y. Wu, "Network coding for the internet and wireless networks," IEEE Signal Processing Mag., vol. 24, no. 5, pp. 77-85, Sep. 2007. (Pubitemid 350130507)
13. S. Deb, M. Effros, T. Ho, D. R. Karger, R. Koetter, D. S. Lun, M. Medard, and N. Ratnakar, "Network coding for wireless applications: A brief tutorial," in IWWAN, 2005.
14. T. Ho and D. S. Lun, Network Coding, An introduction. Cambridge Univ. Press, 2008.
15. D. S. Lun, T. Ho, N. Ratnakar, M. Medard, and R. Koetter, Cooperation in Wireless Networks: Principles and Applications. Springer, 2006, ch. Network Coding in wireless networks, pp. 127-161.
16. M. Medard and A. Sprintson, Eds., Network Coding: Fundamentals and Applications. Academic Press, 2011.
17. "Network coding website." [Online]. Available: http://www. networkcoding.info/bibliography.php
18. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
19. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
20. Z. Li and B. Li, "Network coding in undirected networks," in the 38th Annu. Conf. Information Sciences and Systems (CISS 2004), Princeton, NJ, Mar. 2004.
21. S.-Y. R. Li and Q. T. Sun, "Network coding theory via commutative algebra," IEEE Trans. Inf. Theory, vol. 57, no. 1, pp. 403-415, Jan. 2011.
22. R. W. Yeung and N. Cai, "Network error correction, part I: Basic concepts and upper bounds," Communications in Information and Systems, vol. 6, pp. 19-36, 2006.
23. N. Cai and R. W. Yeung, "Network error correction, part II: lower bounds," Communications in Information and Systems, vol. 6, no. 1, pp. 37-54, 2006.
24. D. Slepian and J. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. 19, no. 4, pp. 471-480, Jul. 1973.
25. , "A coding theorem for multiple access channels with correlated sources," Bell Syst. tech. journal, vol. 52, no. 7, pp. 1037-1076, Sep. 1973.
26. R. Singleton, "Maximum distance q-nary codes," IEEE Trans. Inf. Theory, vol. 10, no. 2, pp. 116-118, Apr. 1964.
27. J. R. Roche, "Distributed information storage," Ph.D. dissertation, Stanford University, Mar. 1992.
28. R. W. Yeung, "Multilevel diversity coding with distortion," IEEE Trans. Inf. Theory, vol. 41, no. 2, pp. 412-422, Mar. 1995.
29. K. P. Hau and R. W. Yeung, "Multilevel diversity coding with three encoders," in IEEE International Symposium on Information Theory, 1997, Jun.-Jul. 1997, p. 440.
30. J. R. Roche, R. W. Yeung, and K. P. Hau, "Symmetrical multilevel diversity coding," IEEE Trans. Inf. Theory, vol. 43, no. 3, pp. 1059-1064, May 1997. (Pubitemid 127828032)
31. R. W. Yeung and Z. Zhang, "On symmetrical multilevel diversity coding," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 609-621, Mar. 1999.
32. , "Distributed source coding for satellite communications," IEEE Trans. Inf. Theory, vol. 45, no. 4, pp. 1111-1120, May 1999.
33. S. P. Borade, "Network information flow: limits and achievability," in IEEE International Symposium on Information Theory, 2002, Jun.-Jul. 2002, p. 139. (Pubitemid 34964759)
34. L. Song and R. W. Yeung, "On point-to-point communication networks," in IEEE International Symposium on Information Theory, 2000, Jun. 2000, p. 21. (Pubitemid 32393420)
35. R. W. Yeung, "Network coding: A historical perspective," Proc. IEEE, vol. 99, no. 3, pp. 366-371, Mar. 2011.
36. S. Roman, Advanced Linear Algebra, 2nd ed. Springer, 2005.
37. P. Morandi, Field and Galois theory. Springer, 1996.
38. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms, 2nd ed. Springer, 1997.
39. D. S. Dummit and R. M. Foote, Abstract Algebra, 3rd ed. Wiley, 2004.
40. G. Kemper, A Course in Commutative Algebra. Springer, 2011.
41. J. Harris, Algebraic Geometry, a first course. Springer, 1992.
42. J. L. Gross and J. Yellen, Eds., Handbook of Graph Theory. CRC Press, 2003.
43. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
44. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular graphs. Springer, 1989.
45. J. H. van Lint and R. M. Wilson, A course in Combinatorics, 2nd ed. Cambridge Univ. Press, 2001.
46. L. R. Ford jr. and D. R. Fulkerson, "Maximal flow through a network," Canad. J. Math., vol. 8, pp. 399-404, Feb. 1956.
47. P. Elias, A. Feinstein, and C. E. Shannon, "A note on the maximum flow through a network," IRE Trans. Inf. Theory, vol. 2, no. 4, pp. 117-119, Dec. 1956.
48. G. M. Ziegler, Lectures on Polytopes. Springer, 1995.
49. R. Casse, Projective Geometry, An Introduction. Oxford Univ. Press, 2006.
50. N. White, Ed., Matroid Applications. Cambridge Univ. Press, 1992.
51. , Theory of Matroids. Cambridge Univ. Press, 1986.
52. J. G. Oxley, Matroid Theory. Oxford Univ. Press, 1992.
53. L. Shu and D. J. Costello, Error Control Coding: Fundamentals and Applications. Prentice Hall, 1983.
54. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting codes. North Holland, 1977.
55. J. H. van Lint, Introduction to Coding Theory, 3rd ed. Springer, 1999.
56. R. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 328-336, Mar. 1991.
57. P. Loidreau, "Properties of codes in rank metric," in Proc. 11th International Workshop on Algebraic and Combinatorial Coding Theory, 2008, pp. 192-198.
58. M. Gadouleau and Z. Yan, "Packing and covering properties of rank metric codes," IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3873-3883, Sept. 2008.
59. E. M. Gabidulin, "Theory of codes with maximum rank distance," Problems Inform. Transmission, vol. 21, no. 1, pp. 1-12, Sept. 1985. (Pubitemid 15603356)
60. S. Fujishige, "Polymatroidal dependence structure of a set of random variables," Information and Control, vol. 39, no. 1, pp. 55-72, 1978. (Pubitemid 9408951)
61. N. Pippenger, "What are the laws of information theory?" Special Problems on Communication and Computation Conference, Sep. 1986.
62. R. W. Yeung, "A new outlook on Shannon's information measures," IEEE Trans. Inf. Theory, vol. 37, no. 3, pp. 466-474, May 1991.
63. T. Kawabata and R. W. Yeung, "The structure of the I-measure of a Markov chain," IEEE Trans. Inf. Theory, vol. 38, no. 3, pp. 1146-1149, May 1992.
64. F. Matu?s, "Probabilistic conditional independence structures and matroid theory: background," Int. J. General Systems, vol. 22, pp. 185-196, 1994.
65. R. W. Yeung, "A framework for linear information inequalities," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1924-1934, Nov. 1997. (Pubitemid 127826482)
66. Y.-O. Yan and R. W. Yeung, "Information theoretic inequality prover." [Online]. Available: http://home.ie.cuhk.edu.hk/?ITIP/
67. R. W. Yeung, "On entropy, information inequalities, and groups," CUHK, Tech. Rep. [Online]. Available: http://personal.ie.cuhk.edu. hk/?ITIP/refer.html
68. R. Pulikkoonattu, E. Perron, and S. Diggavi, "Xitip." [Online]. Available: http://xitip.epfl.ch/
69. Z. Zhang and R. W. Yeung, "A non-Shannon-type conditional inequality of information quantities," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1982-1986, Nov. 1997. (Pubitemid 127826487)
70. F. Matu?s and M. Studeny, "Conditional independences among four random variables I," Combinatorics, Probability, and Computing, vol. 4, pp. 269-278, 1994.
71. Z. Zhang and R. W. Yeung, "On characterization of entropy function via information inequalities," IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1440-1452, Jul. 1998. (Pubitemid 128736707)
72. R. W. Yeung and Z. Zhang, "A class of non-Shannon-type information inequalities and their applications," in IEEE International Symposium on Information Theory, 2001, Jun. 2001, p. 231. (Pubitemid 32795470)
73. F. Matu?s, "Conditional independence among four random variables III: final conclusion," Combinatorics, Probability, and Computing, vol. 8, pp. 269-276, 1999. (Pubitemid 129640083)
74. , "Conditional independence among four random variables II," Combinatorics, Probability, and Computing, vol. 4, pp. 407-417, 1995.
75. D. Hammer, A. Romashchenko, A. Shen, and N. Vereshchagin, "Inequalities for Shannon entropy and Kolmogorov complexity," Journal of Computer and System Sciences, vol. 60, pp. 442-464, 2000. (Pubitemid 30586909)
76. A. Kolmogorov, "Logical basis for information theory and probability theory," IEEE Trans. Inf. Theory, vol. 14, no. 5, pp. 662-664, Sep. 1968.
77. M. Li and P. Vitanyi, An introduction to Kolmogorov complexity and its applications, 3rd ed. Springer, 2008.
78. T. Chan, "A combinatorial approach to information inequalities," Communications in Information and Systems, vol. 1, no. 3, pp. 241-254, Sep. 2001.
79. K. Makarychev, Y. Makarychev, A. Romashchenko, and N. Vereshchagin, "A new class of non-Shannon-type inequalities for entropies," Communications in Information and Systems, vol. 2, no. 2, pp. 147-166, Dec. 2002.
80. Z. Zhang and J. Yang, "On a new non-Shannon-type information inequality," in IEEE International Symposium on Information Theory, 2002, Jun.-Jul. 2002, p. 235. (Pubitemid 34964855)
81. R. Ln?eni?cka, "On the tightness of the Zhang-Yeung inequality for gaussian vectors," Communications in Information and Systems, vol. 3, no. 1, pp. 41-46, Jun. 2003.
82. Z. Zhang, "On a new non-Shannon type information inequality," Communications in Information and Systems, vol. 3, no. 1, pp. 47-60, Jun. 2003.
83. H.-L. Chan and R. W. Yeung, "A group-theoretic approach to information inequalities," in IEEE International Symposium on Information Theory, 2000, Jun. 2000, p. 492. (Pubitemid 32393882)
84. T. H. Chan and R. W. Yeung, "On a relation between information inequalities and group theory," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1992-1995, Jul. 2002.
85. F. Matu?s, "Inequalities for Shannon entropies and adhesivity of polymatroids," in Proc. CWIT, 2005, Jun. 2005, pp. 28-31.
86. , "Piecewise linear conditional information inequality," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 236-238, Jan. 2006. (Pubitemid 43263131)
87. , "Adhesivity of polymatroids," Descrete Mathematics, vol. 307, pp. 2464-2477, 2007. (Pubitemid 47464182)
88. , "Two constructions on limits of entropy functions," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 320-330, Jan. 2007. (Pubitemid 46056080)
89. , "Infinitely many information inequalities," in IEEE International Symposium on Information Theory, 2007., Jun. 2007, pp. 41-44.
90. T. H. Chan, "Group characterizable entropy functions," in IEEE International Symposium on Information Theory, 2007, Jun. 2007, pp. 506-510.
91. R. Dougherty, C. Freiling, and K. Zeger, "Six new non-Shannon information inequalities," in IEEE International Symposium on Information Theory, 2006, Jul. 2006, pp. 233-236. (Pubitemid 351244088)
92. W. Xu, J. Wang, and J. Sun, "A projection method for derivation of non-Shannon-type information inequalities," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 2116-2120.
93. R. W. Yeung, Information Theory and Network Coding. Springer, 2008.
94. F. Matu?s, "Entropy functions, information inequalities, and polymatroids," in Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory, 2009, Banff, Canada, Aug. 2009. [Online]. Available: http://ebookbrowse.com/matus-09w5103-talk-pdf-d2906940
95. S.-Y. R. Li and R. W. Yeung, "Network multicast flow via linear coding," in Proc. ISORA, 1998, Aug. 1998, pp. 197-211.
96. S.-Y. R. Li, N. Cai, and R. W. Yeung, "On theory of linear network coding," in International Symposium on Information Theory, 2005, Sep. 2005, pp. 273-277. (Pubitemid 44508205)
97. P.-W. Kwok and R. W. Yeung, "On the relation between linear dispersion and generic network code," in Information Theory Workshop, 2006, Oct. 2006, pp. 413-417.
98. L. Song and R. W. Yeung, "Network information flow-multiple sources," in IEEE International Symposium on Information Theory, 2001, Jun. 2001, p. 102.
99. C. K. Ngai and R. W. Yeung, "Multisource network coding with two sinks," in International Conference on Communications, Circuits and Systems, 2004, vol. 1, Jun. 2004, pp. 34-37. (Pubitemid 40060753)
100. N. Cai and R. W. Yeung, "Network coding and error correction," in Information Theory Workshop, 2002, Oct. 2002, pp. 119-122.
101. R. Koetter and M. Medard, "An algebraic approach to network coding," in IEEE International Symposium on Information Theory, 2001, Jun. 2001, p. 104. (Pubitemid 32795349)
102. , "Beyond routing: an algebraic approach to network coding," in 21st Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, 2002, pp. 122-130. (Pubitemid 34949926)
103. T. Ho, D. R. Karger, M. Medard, and R. Koetter, "Network coding from a network flow perspective," in IEEE International Symposium on Information Theory, 2003, Jun.-Jul. 2003, p. 441.
104. T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in IEEE International Symposium on Information Theory, 2003, Jun.-Jul. 2003, p. 442.
105. A. R. Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. 41st Annual Allerton Conference on Communication, Control and Computing, Oct. 2003.
106. M. Medard, M. Effros, D. R. Karger, and T. Ho, "On coding for non-multicast networks," in Proc. 41st Annual Allerton Conference on Communication, Control and Computing, Oct. 2003.
107. M. Effros, M. Medard, T. Ho, S. Ray, D. Karger, R. Koetter, and B. Hassibi, "Linear network codes: a unified framework for source, channel, and network coding," in DIMACS Series in Descrete Mathematics and Theoretical Computer Science, 2003, pp. 1-20.
108. M. Kim, "Linear network codes: a unified framework for source, channel, and network coding," MIT, Tech. Rep., 2003. [Online]. Available: http://web.mit.edu/6.454/www/www fall 2003/minkyu/summary.pdf
109. S. Riis, "Linear versus non-linear boolean functions in network flow," in 38th Annual Conference Informations Sciences and Systems, Mar. 2004.
110. L. Song, R. W. Yeung, and N. Cai, "Zero-error network coding for acyclic networks," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3129-3139, Dec. 2003.
111. S. Jaggi, P. A. Chou, and K. Jain, "Low complexity algebraic multicast network codes," in IEEE International Symposium on Information Theory, 2003, Jun.-Jul. 2003, p. 368.
112. P. Sanders, S. Egner, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for network information flow," in 15th ACM Symposium Parallel Algorithms and Architectures, Jun. 2003, pp. 286-294.
113. 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. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005. (Pubitemid 40843620)
114. R. Koetter, M. Effros, T. Ho, and M. Medard, "Network codes as codes on graphs," Mar. 2004. [Online]. Available: http://web.mit.edu/people/ medard/codes.pdf
115. A. Tavory, M. Feder, and D. Ron, "Bounds on linear codes for network multicast," Electronic Colloquium on Computational Complexity, vol. 10, 2003.
116. Z. Li, B. Li, D. Jiang, and L. C. Lau, "On achieving optimal end-to-end throughput in data networks: Theoretical and empirical studies," 2004. [Online]. Available: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10. 1.1.4.6912
117. , "On achieving optimal throughput with network coding," in 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, Mar. 2005, pp. 2184-2194. (Pubitemid 41390727)
118. G. Kramer and S. A. Savari, "Cut sets and information flow in networks of two-way channels," in International Symposium on Information Theory, 2004, Jun.-Jul. 2004, p. 33.
119. Y. Wu, P. A. Chou, and K. Jain, "A comparison of network coding and tree packing," in International Symposium on Information Theory, 2004, Jun.-Jul. 2004, p. 143.
120. , "A comparison of network coding and tree packing," Microsoft research, Tech. Rep., 2004. [Online]. Available: http://research.microsoft.com/ pubs/78169/WuCJ04L.pdf
121. K. Jain, M. Mahdian, and M. R. Salavatipour, "Packing steiner trees," in Proc. 14th annual ACM-SIAM symposium on Discrete algorithms.
122. Y. Wu, K. Jain, and S. Kung, "A unification of Edmonds' graph theorem and Ahlswede etc's network coding theorem," in 42nd Allerton Conference Communications, Control, and Computing, Oct. 2004.
123. "A unification of Edmonds' graph theorem and Ahlswede etc's network coding theorem," Princeton Univ., Tech. Rep., Sep. 2004. [Online]. Available: http://www.princeton.edu/?kung/papers pdf/NetworkCoding/WuJK2004.pdf
124. Y. Wu and S.-Y. Kung, "Reduced-complexity network coding for multicasting over ad hoc networks," in IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005, vol. 3, Mar. 2005, pp. 501-504.
125. Y. Wu, K. Jain, and S.-Y. Kung, "A unification of network coding and tree-packing (routing) theorems," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2398-2409, Jun. 2006. (Pubitemid 43898900)
126. N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman, "Comparing network coding with multicommodity flow for the k-pairs communication problem," MIT, Tech. Rep., Nov. 2004. [Online]. Available: http://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TR-964.pdf
127. A. Agarwal and M. Charikar, "On the advantage of network coding for improving network throughput," in IEEE Information Theory Workshop, 2004, Oct. 2004, pp. 247-249. (Pubitemid 40731329)
128. A. R. Lehman and E. Lehman, "Network coding: does the model need tuning?" in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, Jan. 2005, pp. 499-504. [Online]. Available: http://doi.acm.org/10.1145/1070432.1070500 (Pubitemid 40851406)
129. C. Fragouli and E. Soljanin, "On average throughput benefits for network coding," in 42nd Annual Allerton Conference on Communication, Control, and Computing, 2004, Sep.-Oct. 2004. [Online]. Available: http://infoscience.epfl.ch/record/99960
130. , "Decentralized network coding," in IEEE Information Theory Workshop, 2004, Oct. 2004, pp. 310-314. (Pubitemid 40731341)
131. , "Subtree decomposition for network coding," in International Symposium on Information Theory, 2004, Jun.-Jul. 2004, p. 145.
132. C. Fragouli, E. Soljanin, and A. Shokrollahi, "Network coding as a coloring problem," in In Proceedings, 2004. [Online]. Available: http://infoscience.epfl.ch/record/99959/files/network 1.pdf
133. A. R. Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. 15th annual ACM-SIAM symposium on Discrete algorithms.
134. C. K. Ngai and R. W. Yeung, "Network coding gain of combination networks," in IEEE Information Theory Workshop, 2004, Oct. 2004, pp. 283-287. (Pubitemid 40731336)
135. N. J. A. Harvey, D. R. Karger, and K. Murota, "Deterministic network coding by matrix completion," in Proc. 16th annual ACM-SIAM symposium on Discrete algorithms, 2005.
136. N. J. A. Harvey, "Deterministic network coding by matrix completion," Master's thesis, MIT, May 2005.
137. K. Jain, V. V. Vazirani, R. W. Yeung, and G. Yuval, "On the capacity of multiple unicast sessions in undirected graphs," in International Symposium on Information Theory, 2005, Sep. 2005, pp. 563-567.
138. K. Jain, V. V. Vazirani, and G. Yuval, "On the capacity of multiple unicast sessions in undirected graphs," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2805-2809, Jun. 2006. (Pubitemid 43898928)
139. C. Chekuri, C. Fragouli, and E. Soljanin, "On average throughput and alphabet size in network coding," in International Symposium on Information Theory, 2005, Sep. 2005, pp. 1593-1597. (Pubitemid 44508312)
140. , "On average throughput and alphabet size in network coding," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2410-2424, Jun. 2006. (Pubitemid 43898901)
141. G. Kramer and S. A. Savari, "Progressive d-separating edge set bounds on network coding rates," in International Symposium on Information Theory, 2005, Sep. 2005, pp. 1588-1592. (Pubitemid 44508311)
142. , "Edge-cut bounds on network coding rates," Journal of Network and Systems Management, Mar. 2006.
143. P. Pakzad, C. Fragouli, and A. Shokrollahi, "Coding schemes for line networks," in International Symposium on Information Theory, 2005, Sep. 2005, pp. 1853-1857. (Pubitemid 44508365)
144. D. S. Lun, M. Medard, R. Koetter, and M. Effros, "Further results on coding for reliable communication over packet networks," in International Symposium on Information Theory, 2005, Sep. 2005, pp. 1848-1852. (Pubitemid 44508364)
145. M. Langberg, A. Sprintson, and J. Bruck, "The encoding complexity of network coding," in International Symposium on Information Theory, 2005, Sep. 2005, pp. 1987-1991. (Pubitemid 44508392)
146. , "The encoding complexity of network coding," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2386-2397, Jun. 2006. (Pubitemid 43898899)
147. , "Network coding: A computational perspective," IEEE Trans. Inf. Theory, vol. 55, no. 1, pp. 147-157, Jan. 2009.
148. T. Ho and H. Viswanathan, "Dynamic algorithms for multicast with intra-session network coding," IEEE Trans. Inf. Theory, vol. 55, no. 2, pp. 797-815, Feb. 2009.
149. S. Jaggi, Y. Cassuto, and M. Effros, "Low complexity encoding for network codes," in IEEE International Symposium on Information Theory, 2006, Jul. 2006, pp. 40-44. (Pubitemid 351244048)
150. M. Kim, C. W. Ahn, M. Medard, and M. Effros, "On minimizing network coding resources: An evolutionary approach," in NetCod, 2006.
151. M. Kim, M. Medard, V. Aggarwal, U.-M. O'Reilly, W. Kim, C. W. Ahn, and M. Effros, "Evolutionary approaches to minimizing network coding resources," in 26th IEEE International Conference on Computer Communications, May 2007, pp. 1991-1999. (Pubitemid 47334431)
152. M. Xiao, M. Medard, and T. Aulin, "A binary coding approach for combination networks and general erasure networks," in IEEE International Symposium on Information Theory, 2007, Jun. 2007, pp. 786-790.
153. H. Yao and E. Verbin, "Network coding is highly non-approximable, " in 47th annual Allerton conference on Communication, control, and computing.
154. T. Ho, M. Medard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in 41st Annual Allerton Conference on Communication, Control, and Computing, 2003.
155. T. Ho, M. Medard, M. Effros, and R. Koetter, "Network coding for correlated sources," in CISS, 2004.
156. I. Csiszar, "Linear codes for sources and source networks: Error exponents, universal coding," IEEE Trans. Inf. Theory, vol. 28, no. 4, pp. 585-592, Jul. 1982. (Pubitemid 12525110)
157. T. Ho, M. Medard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, "Toward a random operation of networks," pp. 1-8, 2004. [Online]. Available: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84. 6858
158. T. Ho, M. Medard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
159. L. Song, R. W. Yeung, and N. Cai, "A separation theorem for singlesource network coding," IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 1861-1871, May 2006.
160. C. E. Shannon, "The zero error capacity of a noisy channel," IRE Trans. Inf. Theory, vol. 2, no. 3, pp. 8-19, Sep. 1956.
161. Z. Zhang, "Network error correction coding in packetized networks," in IEEE Information Theory Workshop, 2006, Oct. 2006, pp. 433-437.
162. S. Yang and R. W. Yeung, "Characterizations of network error correction/detection and erasure correction," in NetCod, 2007.
163. Z. Zhang, "Linear network error correction codes in packet networks," IEEE Trans. Inf. Theory, vol. 54, no. 1, pp. 209-218, Jan. 2008.
164. S. Yang, C. K. Ngai, and R. W. Yeung, "Construction of linear network codes that achieve a refined Singleton bound," in IEEE International Symposium on Information Theory, 2007, Jun. 2007, pp. 1576-1580.
165. S. Yang and R. W. Yeung, "Refined coding bounds for network error correction," in IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007, Jul. 2007, pp. 1-5.
166. S. Yang, R. W. Yeung, and C. K. Ngai, "Refined coding bounds and code constructions for coherent network error correction," IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1409-1424, Mar. 2011.
167. R. Matsumoto, "Construction algorithm for network error-correcting codes attaining the Singleton bound," IEICE Trans. Fundamentals, vol. E90-A, no. 9, pp. 1729-1735, Sep. 2006.
168. H. Balli, X. Yan, and Z. Zhang, "Error correction capability of random network error correction codes," in IEEE International Symposium on Information Theory, 2007, Jun. 2007, pp. 1581-1585.
169. , "On randomized linear network codes and their error correction capabilities," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3148-3160, Jul. 2009.
170. Z. Zhang, X. Yan, and H. Balli, "Some key problems in network error correction coding theory," in IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007, Jul. 2007, pp. 1-5.
171. Z. Zhang, "Some recent progresses in network error correction coding theory," in 4th Workshop on Network Coding, Theory and Applications, NetCod 2008, Jan. 2008, pp. 1-5.
172. H. Balli, "Random network error correction codes," Ph.D. dissertation, University of Southern California, Dec. 2008.
173. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," in IEEE International Symposium on Information Theory, 2007, Jun. 2007, pp. 791-795.
174. , "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
175. L. Zheng and D. N. C. Tse, "Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel," IEEE Trans. Inf. Theory, vol. 48, no. 2, pp. 359-383, Feb. 2002. (Pubitemid 34491192)
176. D. Silva and F. R. Kschischang, "Using rank-metric codes for error correction in random network coding," in IEEE International Symposium on Information Theory, 2007, Jun. 2007, pp. 796-800.
177. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," in IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007, Jul. 2007, pp. 1-5.
178. , "A rank-metric approach to error control in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3951-3967, Sep. 2008.
179. D. Silva and F. R. Kschischang, "Rank-metric codes for priority encoding transmission with network coding," in 10th Canadian Workshop on Information Theory, 2007, Jun. 2007, pp. 81-84. (Pubitemid 47469358)
180. S.-T. Xia and F.-W. Fu, "Johnson type bounds on constant dimension codes," Designs, Codes and Cryptography, vol. 50, no. 2, pp. 163-172, 2009.
181. A. Montanari and R. L. Urbanke, "Coding for network coding," CoRR, vol. abs/0711.3935, 2007. [Online]. Available: http://arxiv.org/abs/0711. 3935
182. A. Montanari, V. Rathi, and R. Urbanke, "Iterative coding for network coding," Mar. 2008. [Online]. Available: http://cnls.lanl.gov/CQIT/ montanari.pdf
183. D. Silva, F. R. Kschischang, and R. Koetter, "Capacity of random network coding under a probabilistic error model," in 24th Biennial Symposium on Communications, 2008, Jun. 2008, pp. 9-12.
184. , "Communication over finite-field matrix channels," IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1296-1305, Mar. 2010.
185. E. M. Gabidulin and M. Bossert, "Codes for network coding," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 867-870.
186. F. Manganiello, E. Gorla, and J. Rosenthal, "Spread codes and spread decoding in network coding," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 881-885.
187. V. Skachek, "Recursive code construction for random networks," IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1378-1382, Mar. 2010.
188. T. Etzion and A. Vardy, "Error-correcting codes in projective space," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 871-875.
189. T. Etzion and N. Silberstein, "Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 2909-2919, Jul. 2009.
190. M. Gadouleau and Z. Yan, "Constant-rank codes and their connection to constant-dimension codes," in 5th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, 2008, Jun. 2008, pp. 1-6.
191. , "Constant-rank codes and their connection to constant-dimension codes," IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3207-3216, Jul. 2010.
192. , "Constant-rank codes," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 876-880.
193. A. Kohnert and S. Kurz, "Construction of large constant dimension codes with a prescribed minimum distance," in Mathematical Methods in Computer Science, ser. Lecture Notes in Computer Science, J. Calmet, W. Geiselmann, and J. Mller-Quade, Eds. Springer Berlin/Heidelberg, vol. 5393, pp. 31-42. [Online]. Available: http://dx.doi.org/10.1007/978-3-540-89994-5 4
194. H. Bahramgiri and F. Lahouti, "Block network error control codes and syndrome-based complete maximum likelihood decoding," CoRR, vol. abs/0809.4149, 2008. [Online]. Available: http://arxiv.org/abs/0809.4149
195. , "Block network error control codes and syndrome-based maximum likelihood decoding," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 807-811.
196. M. J. Siavoshani, C. Fragouli, and S. Diggavi, "Noncoherent multisource network coding," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 817-821.
197. S. Yang, R. W. Yeung, and Z. Zhang, "Weight properties of network codes," European Transactions on Telecommunications, vol. 19, no. 4, pp. 371-383, 2008. [Online]. Available: http://dx.doi.org/10.1002/ett.1290
198. , "Characterization of error correction and detection in a general transmission system," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 812-816.
199. S. Yang, "Coherent network error correction," Ph.D. dissertation, The Chinese University of Hong Kong, Sep. 2008.
200. S. Mohajer, M. Jafari, S. N. Diggavi, and C. Fragouli, "On the capacity of multisource non-coherent network coding," in IEEE Information Theory Workshop on Networking and Information Theory, 2009, Jun. 2009, pp. 130-134.
201. M. Jafari, S. Mohajer, C. Fragouli, and S. Diggavi, "On the capacity of non-coherent network coding," in IEEE International Symposium on Information Theory, 2009, Jun.-Jul 2009, pp. 273-277.
202. M. J. Siavoshani, S. Mohajer, C. Fragouli, and S. N. Diggavi, "On the capacity of noncoherent network coding," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1046-1066, Feb. 2011.
203. M. Gadouleau and Z. Yan, "On the decoder error probability of bounded rank distance decoders for rank metric codes," in IEEE Information Theory Workshop, 2009, Oct. 2009, pp. 485-489.
204. H. Balli and Z. Zhang, "On the limiting behavior of random linear network codes," in Workshop on Network Coding, Theory, and Applications, 2009. NetCod, Jun. 2009, pp. 1-5.
205. R. Ahlswede and H. Aydinian, "On error control codes for random network coding," in Workshop on Network Coding, Theory, and Applications, 2009. NetCod, Jun. 2009, pp. 68-73.
206. R. Ahlswede, H. K. Aydinian, and L. H. Khachatrian, "On perfect codes and related concepts," Des. Codes Cryptography, vol. 22, pp. 221-237, Apr. 2001. [Online]. Available: http://dl.acm.org/citation.cfm?id=373647.373652 (Pubitemid 33690780)
207. S. Vyetrenko, T. Ho, and E. Erez, "On noncoherent correction of network errors and erasures with random locations," in IEEE International Symposium on Information Theory, 2009, Jun.-Jul. 2009, pp. 996-1000.
208. S. Vyetrenko, T. Ho, M. Effros, J. Kliewer, and E. Erez, "Rate regions for coherent and noncoherent multisource network error correction," in IEEE International Symposium on Information Theory, 2009, Jun.-Jul. 2009, pp. 1001-1005.
209. M. Jafari, L. Keller, C. Fragouli, and K. Argyraki, "Compressed network coding vectors," in IEEE International Symposium on Information Theory, 2009, Jun.-Jul. 2009, pp. 109-113.
210. P. Chou, Y. Wu, and K. Jain, "Practical network coding," 2003. [Online]. Available: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11. 697
211. S. Li and A. Ramamoorthy, "Improved compression of network coding vectors using erasure decoding and list decoding," CoRR, vol. abs/1006.0245, 2010. [Online]. Available: http://arxiv.org/abs/1006. 0245
212. S. Yang and E.-H. Yang, "The worst network topology for random linear network coding," University of Waterloo, Tech. Rep., Jul. 2009. [Online]. Available: http://home.ie.cuhk.edu.hk/?shyang/pub/worst09. pdf
213. E. M. Gabidulin, M. Bossert, and N. I. Pilipchuk, "Correcting generalized matrix erasures with applications to random network coding," in International ITG Conference on Source and Channel Coding, 2010, Jan. 2010, pp. 1-7.
214. S. Yang, S.-W. Ho, J. Meng, E.-H. Yang, and R. W. Yeung, "Linear operator channels over finite fields," CoRR, vol. abs/1002.2293, 2010. [Online]. Available: http://arxiv.org/abs/1002.2293
215. S. Yang, S.-W. Ho, J. Meng, and E.-H. Yang, "Optimality of subspace coding for linear operator channels over finite fields," in IEEE Information Theory Workshop, 2010, Jan. 2010, pp. 1-5.
216. S. Yang, J. Meng, and E.-H. Yang, "Coding for linear operator channels over finite fields," in IEEE International Symposium on Information Theory Proceedings, 2010, Jun. 2010, pp. 2413-2417.
217. B. F. Uchoa-Filho and R. W. Nobrega, "The capacity of random linear coding networks as subspace channels," CoRR, vol. abs/1001.1021, 2010. [Online]. Available: http://arxiv.org/abs/1001.1021
218. R. W. Nobrega and B. F. Uchoa-Filho, "Multishot codes for network coding using rank-metric codes," in IEEE Wireless Network Coding Conference, 2010, Jun. 2010, pp. 1-6.
219. X. Guang and F.-W. Fu, "The failure probability at sink node of random linear network coding," in IEEE International Conference on Information Theory and Information Security, 2010, Dec. 2010, pp. 876-879.
220. Z. Zhang, "Theory and applications of network error correction coding," Proc. IEEE, vol. 99, no. 3, pp. 406-420, Mar. 2011.
221. C. Fragouli, "Network coding: Beyond throughput benefits," Proc. IEEE, vol. 99, no. 3, pp. 461-475, Mar. 2011.
222. A. Khaleghi, D. Silva, and F. R. Kschischang, Cryptography and Coding: 12th IMA International Conference, IMACC 2009. Springer, 2009, ch. Subspace codes, pp. 1-21. [Online]. Available: http://gpqcom.ufsc.br/?danilo/research/ 2009 KSK LNCS.pdf
223. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 829-848, Mar. 2006. (Pubitemid 46444876)
224. , "A connection between network coding and convolutional codes," in IEEE International Conference on Communications, 2004, vol. 2, Jun. 2004, pp. 661-666.
225. E. Erez and M. Feder, "Convolutional network codes," in International Symposium on Information Theory, 2004, Jun.-Jul. 2004, p. 146.
226. S. Jaggi, M. Effros, T. Ho, and M. Medard, "On linear network coding," Oct. 2004. [Online]. Available: www.its.caltech.edu/?tho/on linearity.ps
227. E. Erez and M. Feder, "Convolutional network codes for cyclic networks," in NetCod, 2005, Apr. 2005. [Online]. Available: http://netcod.org/papers/03ErezF-final.pdf
228. , "Efficient network codes for cyclic networks," in International Symposium on Information Theory, 2005, Sep. 2005, pp. 1982-1986. (Pubitemid 44508391)
229. , "Efficient network code design for cyclic networks," IEEE Trans. Inf. Theory, vol. 56, no. 8, pp. 3862-3878, Aug. 2010.
230. S.-Y. R. Li and R. W. Yeung, "On convolutional network coding," in IEEE International Symposium on Information Theory, 2006, Jul. 2006, pp. 1743-1747. (Pubitemid 351244397)
231. A. I. Barbero and Ø. Ytrehus, "An efficient centralized binary multicast network coding algorithm for any cyclic network," CoRR, vol. abs/0705.0085, 2007. [Online]. Available: http://arxiv.org/abs/0705.0085
232. , Selected topics in information and coding theory. World Scientific, 2010, ch. Introduction to network coding for acyclic and cyclic networks, pp. 339-421.
233. R. Dougherty, C. Freiling, and K. Zeger, "Linearity and solvability in multicast networks," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2243-2256, Oct. 2004.
234. , "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005. (Pubitemid 41158597)
235. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 777-788, Mar. 2006. (Pubitemid 46444873)
236. R. Dougherty, C. Freiling, and K. Zeger, "Unachievability of network coding capacity," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2365-2372, Jun. 2006. (Pubitemid 43898897)
237. R. Dougherty and K. Zeger, "Nonreversibility and equivalent constructions of multiple-unicast networks," IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 5067-5077, Nov. 2006. (Pubitemid 44680592)
238. S. Riis, "Reversible and irreversible information networks," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4339-4349, Nov. 2007. (Pubitemid 350141930)
239. U. Niesen, C. Fragouli, and D. Tuninetti, "On capacity of line networks," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 4039-4058, Nov. 2007. (Pubitemid 350141902)
240. A. Ramamoorthy, J. Shi, and R. D. Wesel, "On the capacity of network coding for random networks," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2878-2885, Aug. 2005. (Pubitemid 41158606)
241. N. J. A. Harvey, R. Kleinberg, and A. R. Lehman, "On the capacity of information networks," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2345-2364, Jun. 2006. (Pubitemid 43898896)
242. T. H. Chan, "On the optimality of group network codes," in International Symposium on Information Theory, 2005, Sep. 2005, pp. 1992-1996. (Pubitemid 44508393)
243. X. Yan, J. Yang, and Z. Zhang, "An improved outer bound for multisource multisink network coding," in NetCod, 2005, 2005. [Online]. Available: http://www.netcod.org/papers/07YanYZ-final.pdf
244. , "An outer bound for multisource multisink network coding with minimum cost consideration," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2373-2385, Jun. 2006. (Pubitemid 43898898)
245. R. Dougherty, C. Freiling, and K. Zeger, "Networks, matroids, and non-Shannon information inequalities," IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 1949-1969, Jun. 2007. (Pubitemid 46852015)
246. J. Cannons and K. Zeger, "Network coding capacity with a constrained number of coding nodes," IEEE Trans. Inf. Theory, vol. 54, no. 3, pp. 1287-1291, Mar. 2008. (Pubitemid 351410933)
247. X. Yan, R. W. Yeung, and Z. Zhang, "The capacity region for multisource multi-sink network coding," in IEEE International Symposium on Information Theory, 2007, Jun. 2007, pp. 116-120.
248. T. H. Chan, "Capacity regions for linear and abelian network codes," in Information Theory and Applications Workshop, 2007, Jan.-Feb. 2007, pp. 73-78.
249. T. Chan and A. Grant, "Entropy vectors and network codes," in IEEE International Symposium on Information Theory, 2007, Jun. 2007, pp. 1586-1590.
250. , "Dualities between entropy functions and network codes," in 4th Workshop on Network Coding, Theory and Applications, 2008. NetCod, Jan. 2008, pp. 1-6.
251. , "Dualities between entropy functions and network codes," IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4470-4487, Oct. 2008.
252. , "Mission impossible: Computing the network coding capacity region," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 320-324.
253. M. Langberg and A. Sprintson, "On the hardness of approximating the network coding capacity," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 315-319.
254. S. El Rouayheb, A. Sprintson, and C. Georghiades, "On the index coding problem and its relation to network coding and matroid theory," IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3187-3195, Jul. 2010.
255. M. Langberg and A. Sprintson, "On the hardness of approximating the network coding capacity," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1008-1014, Feb. 2011.
256. R. Dougherty, C. Freiling, and K. Zeger, "Linear network codes and systems of polynomial equations," IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2303-2316, May 2008. (Pubitemid 351689561)
257. Q. Sun, S. T. Ho, and S.-Y. R. Li, "On network matroids and linear network codes," in IEEE International Symposium on Information Theory, 2008, Jul. 2008, pp. 1833-1837.
258. S. M. S. T. Yazdi, S. A. Savari, G. Kramer, K. Carlson, and F. Farnoud, "On the multimessage capacity region for undirected ring networks," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1930-1947, Apr. 2010.
259. B. K. Rai and B. K. Dey, "On network coding for sum-networks," IEEE Trans. Inf. Theory, vol. 58, no. 1, pp. 50-63, Jan. 2012.
260. S. Thakor, A. Grant, and T. Chan, "Network coding capacity: A functional dependence bound," in IEEE International Symposium on Information Theory, 2009, Jun.-Jul. 2009, pp. 263-267.
261. R. Dougherty, C. Freiling, and K. Zeger, "Network coding and matroid theory," Proceedings of the IEEE, vol. 99, no. 3, pp. 388-405, Mar. 2011.
262. S. L. Fong and R. W. Yeung, "Variable-rate linear network coding," in IEEE Information Theory Workshop, 2006, Oct. 2006, pp. 409-412.
263. , "Variable-rate linear network coding," IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2618-2625, Jun. 2010.
264. J. Si, B. Zhuang, A. Cai, and G. Li, "Unified frameworks for the constructions of variable-rate linear network codes and variable-rate static linear network codes," in International Symposium on Network Coding, 2011. NetCod, Jul. 2011, pp. 1-6.
265. S.-Y. R. Li and S. T. Ho, "Ring-theoretic foundation of convolutional network coding," in 4th Workshop on Network Coding, Theory and Applications, 2008. NetCod, Jan. 2008, pp. 1-6.
266. Q. T. Sun, "Network coding theory based on commutative algebra and matroids," Ph.D. dissertation, The Chinese University of Hong Kong, Jul. 2009.
267. S.-Y. R. Li, Q. T. Sun, and Z. Shao, "Linear network coding: Theory and algorithms," Proc. IEEE, vol. 99, no. 3, pp. 372-387, Mar. 2011.
268. M. Tan, R. W. Yeung, and S. T. Ho, "A unified framework for linear network codes," in 4th Workshop on Network Coding, Theory and Applications, 2008. NetCod, Jan. 2008, pp. 1-5.
269. M. Tan, R. W. Yeung, S. T. Ho, and N. Cai, "A unified framework for linear network coding," IEEE Trans. Inf. Theory, vol. 57, no. 1, pp. 416-423, Jan. 2011.
270. J. Ebrahimi and C. Fragouli, "Multicasting algorithms for deterministic networks," in IEEE Information Theory Workshop, 2010, Jan. 2010, pp. 1-5.
271. , "Vector network coding algorithms," in IEEE International Symposium on Information Theory, 2010, Jun. 2010, pp. 2408-2412.
272. , "Algebraic algorithms for vector network coding," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 996-1007, Feb. 2011.
273. X. Li, T. Jiang, Q. Zhang, and L. Wang, "Binary linear multicast network coding on acyclic networks: principles and applications in wireless communication networks," IEEE J. Sel. Areas Commun., vol. 27, no. 5, pp. 738-748, Jun. 2009.
274. X. Li, T. Jiang, S. Cui, J. An, and Q. Zhang, "Cooperative communications based on rateless network coding in distributed mimo systems," IEEE Wireless Commun., vol. 17, no. 3, pp. 60-67, Jun. 2010.
275. A. A. Gohari, S. Yang, and S. Jaggi, "Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources," in IEEE International Symposium on Information Theory Proceedings, 2011, Jul.-Aug. 2011, pp. 598-602.
276. S. Yang and R. W. Yeung, "Coding for a network coded fountain," in IEEE International Symposium on Information Theory Proceedings, 2011, Jul.-Aug. 2011, pp. 2647-2651.
277. , "Large file transmission in network-coded networks with packet loss-a performance perspective," in Proc. 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies.
278. M. Luby, "LT codes," in 43rd Annual IEEE Symposium on Foundations of Computer Science, Nov. 2002, pp. 271-282. [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/dfountain/LT.pdf
279. M.-L. Champel, K. Huguenin, A.-M. Kermarrec, and N. Le Scouarnec, "LT network codes," in IEEE 30th International Conference on Distributed Computing Systems, 2010, Jun. 2010, pp. 536-546.
280. Z. Shao, M. Chen, and S.-Y. R. Li, "Distributed optimization for combinatorial coding subgraph selection problems," in International Symposium on Network Coding, 2011. NetCod, Jul. 2011, pp. 1-4.
281. S. M. S. Yazdi, S. A. Savari, and G. Kramer, "Network coding in nodeconstrained line and star networks," IEEE Trans. Inf. Theory, vol. 57, no. 7, pp. 4452-4468, Jul. 2011.
282. S. Maheshwar, Z. Li, and B. Li, "Bounding the coding advantage of combination network coding in undirected networks," IEEE Trans. Inf. Theory, vol. 58, no. 2, pp. 570-584, Feb. 2012.
283. J. Huang, L. Wang, W. Cheng, and H. Li, "Polynomial time construction algorithm of BCNC for network coding in cyclic networks," in 8th IEEE/ACIS International Conference on Computer and Information Science, 2009, Jun. 2009, pp. 228-233.
284. J. Huang, L. Wang, T. Zhang, and H. Li, "Constructing network coding in cyclic networks with the best linear independence," in 4th International Conference on Computer Sciences and Convergence Information Technology, 2009, Nov. 2009, pp. 818-823.
285. , "Unified construction algorithm of network coding in cyclic networks," in 15th Asia-Pacific Conference on Communications, 2009, Oct. 2009, pp. 749-753.
286. N. Cai and W. Guo, "The conditions to determine convolutional network coding on matrix representation," in Workshop on Network Coding, Theory, and Applications, 2009. NetCod, Jun. 2009, pp. 24-29.
287. W. Guo, N. Cai, X. Shi, and M. Medard, "Localized dimension growth in random network coding: A convolutional approach," in IEEE International Symposium on Information Theory, 2011, Jul.-Aug. 2011, pp. 1156-1160.
288. Q. T. Sun, S. Jaggi, and S.-Y. R. Li, "Delay invariant convolutional network codes," in IEEE International Symposium on Information Theory Proceedings, 2011, Jul.-Aug. 2011, pp. 2492-2496.
289. Q. Guo, M. Luo, L. Li, L. Wang, and Y. Yang, "Construction of convolutional network coding for cyclic multicast networks," in IEEE 2nd Symposium on Web Society, 2010, Aug. 2010, pp. 336-341.
290. K. Prasad and B. S. Rajan, "On network coding for acyclic networks with delays," in IEEE Information Theory Workshop, 2011, Oct. 2011, pp. 523-527.
291. X. Li, W. H. Mow, and F.-L. Tsang, "Singularity probability analysis for sparse random linear network coding," in IEEE International Conference on Communications, 2011, Jun. 2011, pp. 1-5.
292. , "Rank distribution analysis for sparse random linear network coding," in International Symposium on Network Coding, 2011. Net-Cod, Jul. 2011, pp. 1-6.
293. N. Cai, "Network localized error correction: For non-coherent coding," in IEEE International Symposium on Information Theory, 2011, Jul.-Aug. 2011, pp. 1146-1150.
294. X. Guang, F.-W. Fu, and Z. Zhang, "Construction of network error correction codes in packet networks," in International Symposium on Network Coding, 2011. NetCod, Jul. 2011, pp. 1-6.
295. , "Universal network error correction MDS codes," in International Symposium on Network Coding, 2011. NetCod, Jul. 2011, pp. 1-6.
296. Z.-Y. Zhang, Y. Jiang, and S.-T. Xia, "On the linear programming bounds for constant dimension codes," in International Symposium on Network Coding, 2011. NetCod, Jul. 2011, pp. 1-4.
297. K. Prasad and B. S. Rajan, "Convolutional codes for network-error correction," in IEEE Global Telecommunications Conference, 2009, Nov.-Dec. 2009, pp. 1-6.
298. , "On network-error correcting convolutional codes under the BSC edge error model," in IEEE International Symposium on Information Theory Proceedings, 2010, Jun. 2010, pp. 2418-2422.
299. , "Network-error correcting codes using small fields," in IEEE International Symposium on Information Theory Proceedings, 2011, Jul.-Aug. 2011, pp. 1930-1934.
300. M. Gadouleau and A. Goupil, "A matroid framework for noncoherent random network communications," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1031-1045, Feb. 2011.
301. C.-K. Ngai, R. W. Yeung, and Z. Zhang, "Network generalized Hamming weight," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1136-1143, Feb. 2011.
302. S. Kim, T. Ho, M. Effros, and S. Avestimehr, "Network error correction with unequal link capacities," in 47th annual Allerton conference on Communication, control, and computing.
303. , "New results on network error correction: Capacities and upper bounds," in Information Theory and Applications Workshop, 2010, Jan.-Feb. 2010, pp. 1-10.
304. S. Kim, T. Ho, M. Effros, and A. Avestimehr, "Network error correction with unequal link capacities," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1144-1164, Feb. 2011.
305. C. Yao, J. K. Zao, C.-H. Wang, S.-Y. R. Li, N. A. Claude, and K.-K. Yen, "On separation vectors of static linear network codes with UEP capability," in International Symposium on Network Coding, 2011. NetCod, Jul. 2011, pp. 1-6.
306. M. Gadouleau and S. Riis, "Graph-theoretical constructions for graph entropy and network coding based communications," IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6703-6717, Oct. 2011.
307. A. Kim and M. Medard, "Computing bounds on network capacity regions as a polytope reconstruction problem," in IEEE International Symposium on Information Theory Proceedings, 2011, Jul.-Aug. 2011, pp. 588-592.
308. T. Chan and A. Grant, "On capacity regions of non-multicast networks," in IEEE International Symposium on Information Theory Proceedings, 2010, Jun. 2010, pp. 2378-2382.
309. R. Ghrist and Y. Hiraoka, "Applications of sheaf cohomology and exact sequences on network codings." [Online]. Available: http://www.math.upenn.edu/?ghrist/preprints/networkcodingshort.pdf
310. R. Dougherty, "Is network coding undecidable?" in Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory, 2009, Banff, Canada, Aug. 2009. [Online]. Available: http://temple.birs.ca/?09w5103/dougherty 09w5103 talk1.pdf