Polytope codes against adversaries in networks
暂无分享,去创建一个
[1] Muriel Médard,et al. An algebraic watchdog for wireless network coding , 2009, 2009 IEEE International Symposium on Information Theory.
[2] Danny Dolev,et al. The Byzantine Generals Strike Again , 1981, J. Algorithms.
[3] Tracey Ho,et al. Byzantine modification detection in multicast networks using randomized network coding , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[4] Tracey Ho,et al. Network error correction with unequal link capacities , 2009 .
[5] Tracey Ho,et al. Resilient Network Coding in the Presence of Byzantine Adversaries , 2007, INFOCOM.
[6] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[7] Nitin H. Vaidya,et al. When Watchdog Meets Coding , 2009, 2010 Proceedings IEEE INFOCOM.
[8] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[9] Ning Cai,et al. Network Error Correction, I: Basic Concepts and Upper Bounds , 2006, Commun. Inf. Syst..
[10] Lang Tong,et al. Nonlinear network coding is necessary to combat general Byzantine attacks , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[11] Frank R. Kschischang,et al. Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.
[12] R. Yeung,et al. NETWORK ERROR CORRECTION, PART II: LOWER BOUNDS , 2006 .