Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2010, Article ID 436354, 11 pages
http://dx.doi.org/10.1155/2010/436354
Research Article

A Computational Perspective on Network Coding

Qin Guo,1,2,3 Mingxing Luo,1,2,3 Lixiang Li,1,2,3 and Yixian Yang1,2,3

1Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
2Key Laboratory of Network and Information Attack and Defence Technology of MOE, Beijing University of Posts and Telecommunications, Beijing 100876, China
3National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received 10 March 2010; Revised 4 July 2010; Accepted 25 August 2010

Academic Editor: Jyh Horng Chou

Copyright © 2010 Qin Guo et al. 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 Zentralblatt MATH
  2. 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
  3. 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 Zentralblatt MATH
  4. R. Koetter and M. Médard, “An algebraic approach to network coding,” IEEE/ACM Transactions on Networking, vol. 5, pp. 782–795, 2003. View at Google Scholar
  5. 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
  6. D. Charles, K. Jain, and K. Lauter, “Signatures for network coding,” International Journal of Information and Coding Theory, vol. 1, pp. 3–14, 2009. View at Publisher · View at Google Scholar
  7. D. Boneh, D. Freeman, J. Katz, and B. Waters, “Signing a linear subspace: signature schemes for network coding,” in Public Key Cryptography—PKC 2009, vol. 5443 of Lecture Notes in Computer Science, pp. 68–87, Springer, Berlin, UK, 2009. View at Publisher · View at Google Scholar
  8. M. Langberg, A. Sprintson, and J. Bruck, “The encoding complexity of network coding,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2386–2397, 2006. View at Publisher · View at Google Scholar
  9. 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
  10. J. Bang-Jensen and G. Gutin, Digraphs. Theory, Algorithms and Applications, Springer, London, UK, 2nd edition, 2008.
  11. V. Krishnamurthy, Combinatorics: Theory and Applications, Ellis Horwood Series in Mathematics and Its Applications: Statistics and Operational Research, Ellis Horwood, Chichester, UK, 1986.
  12. M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman, San Francisco, Calif, USA, 1979.