|
Ahlswede R, Cai N, and Li S Y, et al.. Network informationflow [J].IEEE Transactions on Information Theory.2000,46(4):1204-1216[2]Li S Y, Yeung R W, and Cai N. Linear network coding [J].IEEE Transactions on Information Theory.2003, 49(2):371-381[3]Ho T, Koetter R, and Medard M, et al.. The benefits ofcoding over routing in a randomized setting [C]. IEEEInternational Symposium on Information Theory, YokohamaJapan, 2003: 442.[4]Geil1 O, Matsumoto R, and Thomsen1 C. On field size andsuccess probability in network coding [C][J].Lecture Notes inComputer Science.2008, 5130:157-173[5]武广柱, 王劲林, 齐卫宁. ARLNC Stream: 自适应随机网络编码流媒体系统[J].电子与信息学报.2008, 30(1):25-28浏览[6]Cai N and Yeung R W. Secure network coding [C]. IEEEInternational Symposium on Information Theory, Lausanne,Switzerland, 2002：323.[7]Feldman J, Malkin T, and Stein C, et al.. On the capacity ofsecure network coding [C]. In Proc. 42nd Annual AllertonConference on Communication, Control, and Computing,Monticello, IL, USA, Sep. 2004.[8]Chanl T and Grant A. Capacity bounds for secure networkcoding [C]. Communication theory workshop, Australian,2008: 95-100.[9]Bhattad K and Narayanan K R. Weakly secure networkcoding [C]. In Proc. of the First Workshop on NetworkCoding, Theory, and Applications (NetCod), Riva del, Garda,Italy, 2005.[10]Jain K. Security based on network topology against thewiretapping attack [J].IEEE Wireless Communications.2004, 11(1):68-71[11]Lima L, Medard M, and Barros J. Random linear networkcoding: A free cipher? [C]. IEEE International Symposium onInformation Theory, Nice, France, 2007: 546-550.[12]Ho T, Leong B, and Koetter R, et al.. Byzantine modificationdetection in multicast networks using randomized networkcoding [C]. IEEE International Symposium on InformationTheory, Chicago, USA, 2004: 144.[13]Jaggi S, Langberg M, and Katti S, et al.. Resilient networkcoding in the presence of Byzantine adversaries [C]. 26thIEEE International Conference on ComputerCommunications, Anchorage, Alaska, 2007: 616-624.[14]Nutman L and Langberg M. Adversarial models and resilientschemes for network coding [C]. IEEE InternationalSymposium on Information Theory, Toronto, Ontario,Canada, 2008: 171-175.Yu Zhen, Wei Ya-wen, Ramkumar B, and Guan Yong. Anefficient signature-based scheme for securing network codingagainst pollution attacks [C]. Proc 27th Annual IEEEConference on Computer Communication, INFOCOM,(Anchorage, AK), 2008: 1409-1417.[15]Cai N and Yeung R W. Network coding and error correction[C]. IEEE Information Theory Workshop, Bangalore, India,2002: 119-122.[16]Yeung R W and Cai N. Network error correction, part I:basic concepts and upper bounds [J]. Communications inInformation and Systems, 2006, 6(1): 19-36.[17]Cai N and Yeung R W. Network error correction, part II:lower bounds [J]. Communications in Information andSystems, 2006, 6(1): 37-54.[18]Yang Sheng-hao and Yeung R W. Refined coding bounds fornetwork error correction [C]. IEEE Information TheoryWorkshop, Bergen, Norway, 2007: 1-5.Yang Sheng-hao, Ngai C K, and Yeung R W. Construction oflinear network codes that achieve a refined singleton bound[C]. IEEE International Symposium on Information Theory,Nice, France 2007: 1576-1580.[19]Zhang Z. Network error correction coding in packetizednetworks [C]. IEEE Information Theory Workshop, ChengduChina, 2006: 433-437.[20]Zhang Z. Linear network error correction codes in packetnetworks [J].IEEE Transactions on Information Theory.2008, 54(1):209-218[21]Yang Sheng-hao and Yeung R W. Characterizations ofnetwork error correction/ detection and erasure correction[C]. In Proc. of the Third Workshop on Network Coding,Theory, and Applications, San Diego, California, 2007.[22]Koetter R and Kschischang F R. Coding for errors anderasures in random network coding [J]. IEEE Transactionson Information Theory, 2008. 2008, 54(8): 3579-3591.[23]Ngai C K and Yang Sheng-hao. Deterministic secureerror-correcting (SEC) network codes [C]. IEEE InformationTheory Workshop, Bergen, Norway, 2007: 96-101.
|
下载:
