Table of Contents Author Guidelines Submit a Manuscript
International Journal of Digital Multimedia Broadcasting
Volume 2011, Article ID 857847, 12 pages
http://dx.doi.org/10.1155/2011/857847
Review Article

A Survey of Linear Network Coding and Network Error Correction Code Constructions and Algorithms

School of Electronic Engineering and Computer Science, Queen Mary, University of London, London E1 4NS, UK

Received 1 December 2010; Accepted 16 May 2011

Academic Editor: Ning Chen

Copyright © 2011 Michele Sanna and Ebroul Izquierdo. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204–1216, 2000. View at Publisher · View at Google Scholar · View at Scopus
  2. P. A. Chou and Y. Wu, “Network coding for the internet and wireless networks,” Tech. Rep., Microsoft Research, June 2007. View at Google Scholar
  3. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, “XORs in the air: practical wireless network coding,” IEEE/ACM Transactions on Networking, vol. 16, no. 3, pp. 497–510, 2008. View at Publisher · View at Google Scholar · View at Scopus
  4. S. Jaggi, M. Langberg, S. Katti et al., “Resilient network coding in the presence of byzantine adversaries,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2596–2603, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. N. Cai and T. Chan, “Theory of secure network coding,” Proceedings of the IEEE, vol. 99, no. 3, pp. 421–437, 2011. View at Publisher · View at Google Scholar
  6. D. Silva and F. R. Kschischang, “Universal secure network coding via rank-metric codes,” IEEE Transactions on Information Theory, vol. 57, no. 2, pp. 1124–1135, 2011. View at Publisher · View at Google Scholar
  7. R. W. Yeung and N. Cai, “Network error correction. I. Basic concepts and upper bounds,” Communications in Information & Systems, vol. 6, no. 1, pp. 19–35, 2006. View at Google Scholar
  8. N. Cai and R. W. Yeung, “Network error correction. II. Lower bounds,” Communications in Information & Systems, vol. 6, no. 1, pp. 37–54, 2006. View at Google Scholar
  9. K. Jain, L. Lovász, and P. A. Chou, “Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding,” Distributed Computing, vol. 19, no. 4, pp. 301–311, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. C. Gkantsidis and P. R. Rodriguez, “Network coding for large scale content distribution,” in Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05), vol. 4, pp. 2235–2245, March 2005.
  11. S. Y. R. Li, R. W. Yeung, and N. Cai, “Linear network coding,” IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 371–381, 2003. View at Publisher · View at Google Scholar · View at Scopus
  12. R. Koetter and M. Médard, “An algebraic approach to network coding,” IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp. 782–795, 2003. View at Publisher · View at Google Scholar · View at Scopus
  13. R. W. Yeung and S.-Y. R. Li, “Polynomial time construction of generic linear network codes,” in Proceedings of the 43rd Allerton Conference on Communication, Control and Computing, September 2005.
  14. A. R. Lehman and E. Lehman, “Complexity classification of network information flow problems,” in Proceedings of the 41st Annual Allerton Conference on Communication, Control and Computing, 2003.
  15. S. Jaggi, P. Sanders, P. A. Chou et al., “Polynomial time algorithms for multicast network code construction,” IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 1973–1982, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. M. Langberg, A. Sprintson, and J. Bruck, “Network coding: a computational perspective,” IEEE Transactions on Information Theory, vol. 55, no. 1, pp. 147–157, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. C. Fragouli, E. Soljanin, and A. Shokrollahi, “Network coding as a coloring problem,” in Proceedings of the Conference on Information Science and Systems (CISS '04), Princeton, NJ, USA, 2004.
  18. T. H. Chan, “On the optimality of group network codes,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '05), pp. 1992–1996, September 2005. View at Publisher · View at Google Scholar · View at Scopus
  19. Z. Zhang and R. W. Yeung, “On characterization of entropy function via information inequalities,” IEEE Transactions on Information Theory, vol. 44, no. 4, pp. 1440–1452, 1998. View at Google Scholar · View at Scopus
  20. R. Dougherty, C. Freiling, and K. Zeger, “Networks, matroids, and non-Shannon information inequalities,” IEEE Transactions on Information Theory, vol. 53, no. 6, pp. 1949–1969, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. 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, 2005. View at Publisher · View at Google Scholar · View at Scopus
  22. R. Dougherty, C. Freiling, and K. Zeger, “Linearity and solvability in multicast networks,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2243–2256, 2004. View at Publisher · View at Google Scholar · View at Scopus
  23. S. Riis, “Graph entropy, network coding and guessing games,” Tech. Rep. CoRR abs/0711.4175, 2007, http://www.eecs.qmul.ac.uk/~smriis/RiisTRGraphEntro.pdf. View at Google Scholar
  24. S. Riis, “Reversible and irreversible information networks,” IEEE Transactions on Information Theory, vol. 53, no. 11, pp. 4339–4349, 2007. View at Publisher · View at Google Scholar · View at Scopus
  25. L. Song, R. W. Yeung, and N. Cai, “Zero-error network coding for acyclic networks,” IEEE Transactions on Information Theory, vol. 49, no. 12, pp. 3129–3355, 2003. View at Publisher · View at Google Scholar · View at Scopus
  26. X. Yan, R. W. Yeung, and Z. Zhang, “The capacity region for multi-source multi-sink network coding,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '07), pp. 116–120, June 2007. View at Publisher · View at Google Scholar · View at Scopus
  27. J. Barros and S. D. Servetto, “Network information flow with correlated sources,” IEEE Transactions on Information Theory, vol. 52, no. 1, pp. 155–170, 2006. View at Publisher · View at Google Scholar · View at Scopus
  28. R. W. Yeung, Information Theory and Network Coding, Springer, New York, NY, USA, 1st edition, 2008.
  29. A. Ramamoorthy, K. Jain, P. A. Chou, and M. Effros, “Separating distributed source coding from network coding,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2785–2795, 2006. View at Publisher · View at Google Scholar · View at Scopus
  30. Y. Wu, V. Stankovic, Z. Xiong, and S. Y. Kung, “On practical design for joint distributed source and network coding,” IEEE Transactions on Information Theory, vol. 55, no. 4, pp. 1709–1720, 2009. View at Publisher · View at Google Scholar · View at Scopus
  31. T. Ho, M. Médard, R. Koetter et al., “A random linear network coding approach to multicast,” IEEE Transactions on Information Theory, vol. 52, no. 10, pp. 4413–4430, 2006. View at Publisher · View at Google Scholar · View at Scopus
  32. M. Gadouleau and A. Goupil, “A matroid framework for noncoherent random network communications,” IEEE Transactions on Information Theory, vol. 57, no. 2, pp. 1031–1045, 2011. View at Publisher · View at Google Scholar
  33. E. Erez and M. Feder, “Efficient network code design for cyclic networks,” IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3862–3878, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. J. Huang, L. Wang, T. Zhang, and H. Li, “Unified construction algorithm of network coding in cyclic networks,” in Proceedings of the 15th Asia-Pacific Conference on Communications (APCC '09), pp. 749–753, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  35. A. I. Barbero and Ø. Ytrehus, “Cycle-logical treatment for “Cyclopathic” networks,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2795–2804, 2006. View at Publisher · View at Google Scholar · View at Scopus
  36. S. Y. R. Li and Q. T. Sun, “Network coding theory via commutative algebra,” IEEE Transactions on Information Theory, vol. 57, no. 1, pp. 403–415, 2011. View at Publisher · View at Google Scholar · View at Scopus
  37. K. Prasad and B. S. Rajan, “Network error correction for unit-delay, memory-free networks using convolutional codes,” in Proceedings of the IEEE International Conference on Communications (ICC '10), May 2010. View at Publisher · View at Google Scholar · View at Scopus
  38. K. Prasad and B. S. Rajan, “On network-error correcting convolutional codes under the BSC edge error model,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '10), pp. 2418–2422, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  39. 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, pp. 241–329, 2006. View at Publisher · View at Google Scholar · View at Scopus
  40. N. J. A. Harvey, D. R. Karger, and K. Murota, “Deterministic network coding by matrix completion,” in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '05), pp. 489–498, SIAM, Vancouver, Canada, 2005.
  41. R. Dougherty, C. Freiling, and K. Zeger, “Linear network codes and systems of polynomial equations,” IEEE Transactions on Information Theory, vol. 54, no. 5, pp. 2303–2316, 2008. View at Publisher · View at Google Scholar · View at Scopus
  42. S.-Y.R. Li, Q. T. Sun, and Z. Shao, “Linear network coding: theory and algorithms,” Proceedings of the IEEE, vol. 99, no. 3, pp. 372–387, 2011. View at Publisher · View at Google Scholar
  43. H. Balli, X. Yan, and Z. Zhang, “On randomized linear network codes and their error correction capabilities,” IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3148–3160, 2009. View at Publisher · View at Google Scholar · View at Scopus
  44. X. Guang and F.-W. Fu, “The failure probability at sink node of random linear network coding,” in Proceedings of the IEEE International Conference on Information Theory and Information Security (ICITIS '10), pp. 876–879, Beijing, China, December 2010. View at Publisher · View at Google Scholar
  45. P. C. Yunnan, P. A. Chou, Y. Wu, and K. Jain, “Practical network coding,” in Allerton Conference in Communication, Control and Computing, Monticello, Ill, USA, October 2003.
  46. T. Ho, M. Médard, and R. Koetter, “An information-theoretic view of network management,” IEEE Transactions on Information Theory, vol. 51, no. 4, pp. 1295–1312, 2005. View at Publisher · View at Google Scholar · View at Scopus
  47. Z. Zhang, “Linear network error correction codes in packet networks,” IEEE Transactions on Information Theory, vol. 54, no. 1, pp. 209–218, 2008. View at Publisher · View at Google Scholar · View at Scopus
  48. R. Köetter and F. R. Kschischang, “Coding for errors and erasures in random network coding,” IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3579–3591, 2008. View at Publisher · View at Google Scholar · View at Scopus
  49. D. Silva, F. R. Kschischang, and R. Köetter, “A rank-metric approach to error control in random network coding,” IEEE Transactions on Information Theory, vol. 54, no. 9, pp. 3951–3967, 2008. View at Publisher · View at Google Scholar · View at Scopus
  50. S. Yang, R. W. Yeung, and C. K. Ngai, “Refined coding bounds and code constructions for coherent network error correction,” IEEE Transactions on Information Theory, vol. 57, no. 3, pp. 1409–1424, 2011. View at Publisher · View at Google Scholar
  51. 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. View at Publisher · View at Google Scholar · View at Scopus
  52. 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 (ITW '10), pp. 1–5, Cairo, Egypt, January 2010. View at Publisher · View at Google Scholar
  53. D. Silva, F. R. Kschischang, and R. Kotter, “Communication over finite-field matrix channels,” IEEE Transactions on Information Theory, vol. 56, no. 3, pp. 1296–1305, 2010. View at Publisher · View at Google Scholar · View at Scopus
  54. Z. Zhang, “Some recent progresses in network error correction coding theory,” in Proceedings of the 4th Workshop on Network Coding, Theory, and Applications (NetCod '08), pp. 1–5, January 2008. View at Publisher · View at Google Scholar · View at Scopus
  55. H. Bahramgiri and F. Lahouti, “Robust network coding against path failures,” IET Communications, vol. 4, no. 3, pp. 272–284, 2010. View at Publisher · View at Google Scholar · View at Scopus
  56. R. Matsumoto, “Construction algorithm for network error-correcting codes attaining the Singleton bound,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E90-A, no. 9, pp. 1729–1735, 2007. View at Publisher · View at Google Scholar
  57. X. Guang, F.-W. Fu, and Z. Zhang, “Construction of network error correction codes in packet networks,” in Proceedings of the IEEE International Symposium on Network Coding (NetCod '11), Beijing, China, July 2011.
  58. Z. Zhang, X. Yan, and H. Balli, “Some key problems in network error correction coding theory,” in Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks (ITW '07), pp. 131–135, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  59. M. Bossert and E. M. Gabidulin, “One family of algebraic codes for network coding,” in Proceedings of IEEE International Symposium on Information Theory (ISIT '09), vol. 4, pp. 2863–2866, IEEE Press, Seoul, Korea, 2009. View at Publisher · View at Google Scholar
  60. E. M. Gabidulin and M. Bossert, “Algebraic codes for network coding,” Problems of Information Transmission, vol. 45, no. 4, pp. 343–356, 2009. View at Publisher · View at Google Scholar · View at Scopus
  61. M. Gadouleau and Z. Yan, “Packing and covering properties of subspace codes for error control in random linear network coding,” IEEE Transactions on Information Theory, vol. 56, no. 5, article no. 6, pp. 2097–2108, 2010. View at Publisher · View at Google Scholar · View at Scopus
  62. D. Silva and F. R. Kschischang, “On metrics for error correction in network coding,” IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5479–5490, 2009. View at Publisher · View at Google Scholar · View at Scopus
  63. Z. Zhang, “Theory and applications of network error correction coding,” Proceedings of the IEEE, vol. 99, no. 3, pp. 406–420, 2011. View at Publisher · View at Google Scholar
  64. T. Ho and D. S. Lun, Network Coding: An Introduction, Cambridge University Press, Cambridge, UK, 2008.
  65. C. Fragouli and E. Soljanin, “Network coding fundamentals,” Foundations and Trends in Networking, vol. 2, no. 1, pp. 1–133, 2007. View at Publisher · View at Google Scholar · View at Scopus
  66. C. Fragouli and E. Soljanin, “Network coding applications,” Foundations and Trends in Networking, vol. 2, no. 2, pp. 135–269, 2007. View at Publisher · View at Google Scholar · View at Scopus
  67. M. Médard and A. Sprintson, Eds., Network Coding: Fundamentals and Applications, Cambridge University Press, Cambridge, UK, 2011.