[1]Ahlswede R, Cai N, Li S-Y R, et al. Network Information Flow [J]. IEEE Trans on Inf Theory, 2000, 46(4): 1204-1216.
[2]Li S-Y R, Yeung R W, Cai N. Linear Network Coding [J]. IEEE Trans on Inf Theory, 2003, 49(2): 371-381.
[3]Ho T, Koetter R, Medard M, et al. The Benefits of Coding Over Routing in a Randomized Setting [C]//IEEE Intl Symp Inf Theory. Yokohama: IEEE Press, 2003: 442.
[4]Ho T, Medard M, Shi J, et al. On Randomized Network Coding [EB/OL]. [2007-06-08]. http://web.mit.edu/people/medard/allerton3.pdf.
[5]王静, 刘景美, 王新梅, 等. 一种网络编码的多播路由算法 [J]. 西安电子科技大学学报, 2008, 35(1): 71-75.
Wang Jing, Liu Jingmei, Wang Xinmei, et al. Multicast Routing Algorithm for Network Coding [J]. Journal of Xidian University, 2008, 35 (1): 71-75.
[6]Ho T C, Leong B, Koetter R, et al. Byzantine Modification Detection in Multicast Networks Using Randomized Network Coding [C]//IEEE Intl Symp Inf Theory. Chicago: IEEE Press, 2004: 144.
[7]Jaggi S, Langberg M, Katti S. Resilient Network Coding in the Presence of Byzantine Adversaries [C]//26th IEEE International Conference on Computer Communications. Anchorage: IEEE Press, 2007: 616 - 624.
[8]Nutman L, Langberg M. Adversarial Models and Resilient Schemes for Network Coding [C]//IEEE Intl Symp Inf Theory. Toronto: IEEE Press, 2008: 171-175.
[9]Cai N, Yeung R W. Network Coding and Error Correction [C]//IEEE Inform Theory Workshop. Bangalore: IEEE Press, 2002: 119-122.
[10]Zhang Z. Network Error Correction Coding in Packetized Networks [C]//IEEE Information Theory Workshop. Chengdu: IEEE Press, 2006: 433-437.
[11]Zhang Z. Linear Network Error Correction Codes in Packet Networks [J]. IEEE Trans on Inf Theory, 2008, 54(1): 209-218.
[12]孙岳, 杨远, 王新梅. 基于网络编码的多播网络故障恢复[J]. 西安电子科技大学学报, 2007, 34(1): 122-125.
Sun Yue, Yang Yuan, Wang Xinmei. Multicast Fault Recovery on Network Coding [J]. Journal of Xidian University, 2007, 34(1): 122-125.
[13]Cai N, Yeung R W. Secure Network Coding [C]//IEEE Intl Symp Inf Theory. Lausanne: IEEE Press, 2002: 323.
[14]Feldman J, Malkin T, Stein C, et al. On the Capacity of Secure Network Coding [EB/OL]. [2007-06-08]. http://people.csail.mit.edu/jonfeld/pubs/sflow_Allerton04_final.pdf.
[15]Chanl T, Grant A. Capacity Bounds for Secure Network Coding [C]//Communication Theory Workshop. Australian: IEEE Press, 2008: 95-100.
[16]Rouayheb S Y E, Soljanin E. On Wiretap Network II [C]//IEEE Intl Symp Inf Theory. Nice: IEEE Press, 2007: 551-555.
[17]Silva D, Kschischang F R. Security for Wiretap Networks Via Rank-Metric Codes [C]//IEEE Intl Symp Inf Theory. Toronto: IEEE Press, 2008: 176-180.
[18]Bhattad K, Narayanan K R. Weakly Secure Network Coding [EB/OL]. [2007-05-22]. http://netcod.org/papers/06Bhattad N-final.pdf.
[19]Silva D, Kschischang F R. Universal Secure Network Coding Via Rank-Metric Codes [EB/OL]. [2008-11-10]. http://arxiv.org/PS_cache/arxiv/pdf/0809/0809.3546v1.pdf.
[20]Jain K. Security Based on Network Topology Against the Wiretapping Attack [J]. IEEE Wireless Communications, 2004, 11(1): 68-71.
[21]Vilela J P, Lima L, Barros J. Lightweight Security for Network Coding [C]//Proc of the IEEE International Conference on Communications (ICC). Beijing: IEEE Press, 2008: 1750-1754.
[22]Lima L, Medard M, Barros J. Random Linear Network Coding: a Free Cipher? [C]//IEEE Intl Symp Inf Theory. Nice: IEEE Press, 2007: 546-550. |