References

Ahlswede, R., N. Cai, S.Y.R. Li and R.W. Yeung, 2000. Network information flow. IEEE Trans. Inform. Theory, 46: 1204-1216.
CrossRef  |  

Dong, J., R. Curtmola and C. Nita-Rotaru, 2009. Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks. Proceedings of the 2nd ACM Conference on Wireless Network Security, March 16-19, 2009, Zurich, Switzerland, pp: 111-122.

Edmonds, J., 1965. Minimum partition of a matroid into independent subsets. J. Res. Nat. Bur. Standards Sect. B, 69: 67-72.

Gkantsidis, C. and P. Rodriguez, 2006. Cooperative security for network coding file distribution. Proceeding of the 25th IEEE International Conference on Computer Communications, April 23-29, 2006, Barcelona, Spain, pp: 1-13.

Gkantsidis, C. and P.R. Rodriguez, 2005. Network coding for large scale content distribution. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Volume 4, March 13-17, 2005, Miami, FL., USA., pp: 2235-2245.

Gkantsidis, C., J. Miller and P. Rodriguez, 2006. Anatomy of a P2P content distribution system with network coding. Proceedings of the 5th International workshop on Peer-To-Peer Systems, February 27-28, 2006, Santa Barbara, CA., USA., pp: 1-6.

Ho, T., B. Leong, R. Koetter, M. Medard, M. Effros and D.R. Karger, 2008. Byzantine modification detection in multicast networks with random network coding. IEEE Trans. Inform. Theory, 54: 2798-2803.
CrossRef  |  

Ho, T., R. Koetter, M. Medard, D.R. Karger and M. Effros, 2003. The benefits of coding over routing in a randomized setting. Proceedings of the International Symposium on Information Theory, June 29-July 4, 2003, Yokohama, Japan, pp: 442-442.

Jaggi, S., P. Sanders, P.A. Chou, M. Effros, S. Egner, K. Jain and L.M. Tolhuizen, 2005. Polynomial time algorithms for multicast network code construction. IEEE Trans. Inform. Theor., 51: 1973-1982.
CrossRef  |  

Koetter, R. and M. Medard, 2001. An algebraic approach to network coding. Proceedings of the IEEE International Symposium on Information Theory, Jun 24-29, 2001, Washington, DC., USA -.

Koetter, R. and M. Medard, 2003. An algebraic approach to network coding. IEEE/ACM Trans. Networking, 11: 782-796.
CrossRef  |  

Krohn, M.N., M.J. Freedman and D. Mazieres, 2004. On-the-fly verification of rateless erasure codes for efficient content distribution. Proceedings of the IEEE Symposium on Security and Privacy, May 9-12, 2004, Berkeley, CA., USA., pp: 226-240.

Li, B. and D. Niu, 2011. Random network coding in peer-to-peer networks: From theory to practice. Proc. IEEE, 99: 513-523.
CrossRef  |  

Li, Q., J.C. Lui and D.M. Chiu, 2012. On the security and efficiency of content distribution via network coding. IEEE Trans. Dependable Secure Comput., 9: 211-221.
CrossRef  |  Direct Link  |  

Li, S.Y.R., R.W. Yeung and N. Cai, 2003. Linear network coding. IEEE Trans. Inform. Theory, 49: 371-381.
CrossRef  |  Direct Link  |  

Li, Y. and J.C.S. Lui, 2013. Epidemic attacks in network-coding-enabled wireless mesh networks: Detection, identification and evaluation. IEEE Trans. Mobile Comput., 12: 2219-2232.
CrossRef  |  Direct Link  |