[1] Ahlswede R, Cai Ning. Network Information Flow[J]. IEEE Trans. on Information Theory, 2000, 46(4): 1204-1216. [2] Li S Y R, Yeung R W, Cai Ning. Linear Network Coding[J]. IEEE Trans. on Information Theory, 2003, 49(2): 371-381. [3] Cai Ning, Yeung R W. Secure Network Coding[C]//Proc. of ISIT’02. Lausanne, Switzerland: IEEE Press, 2002. [4] Bhattad K, Narayanan K R. Weakly Secure Network Coding[EB/OL]. (2007-05-22). http://netcod.org/papers/06Bhattad N-final.pdf. [5] 周亚军, 李 晖, 马建峰. 防污染和防窃听的网络编码[D]. 西安: 西安电子科技大学, 2009. [6] Langberg M, Sprintson A, Bruck J. The Encoding Complexity of Network Coding[J]. IEEE Trans. on Information Theory, 2006, 52(6): 2386-2397. [7] Bhattad K, Kotter R. Minimal Network Coding for Multicast[C]// Proc. of ISIT’05. Adelaide, Australia: IEEE Press, 2005. [8] Kim M, Medard M. Evolutionary Approaches to Minimizing Network Coding Resources[C]//Proc. of INFOCOM’07. [S. l.]: IEEE Press, 2007. [9] Ma Guanjun, Xu Yinlong, Lin Minghong, et al. A Content Distribution System Based on Sparse Linear Network Coding[C]// Proc. of NetCOD’07. San Diego, USA: [s. n.], 2007. [10] 吴智昊. 基于效用优化的网络编码拥塞控制模型[J]. 计算机工程, 2011, 37(6): 100-103. [11] Cai Ning, Yeung R W. Network Coding and Error Correction[C]// Proc. of ITW’02. Bangalore, India: IEEE Press, 2002. [12] 蔡青松, 牛建伟, 刘 畅. 一种机会网络中的消息发布/订阅算法[J]. 计算机工程, 2011, 37(12): 19-22. [13] Kontter R, Medani M. An Algebraic Approach to Network Co- ding[J]. IEEE/ACM Trans. on Networking, 2003, 11(5): 782-795. [14] Lima L, Medard M, Barros J. Random Linear Network Coding[C]//Proc. of IEEE International Symposium on Infor- mation Theory. [S. l.]: IEEE Press, 2007.
|