Network equivalence for a joint compound-arbitrarily-varying network model
暂无分享,去创建一个
[1] Prakash Narayan,et al. Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.
[2] Imre Csiszár,et al. The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.
[3] Lang Tong,et al. Polytope codes against adversaries in networks , 2010, 2010 IEEE International Symposium on Information Theory.
[4] Jörg Kliewer,et al. Equivalence for networks with adversarial state , 2014, 2014 IEEE International Symposium on Information Theory.
[5] Muriel Médard,et al. A Theory of Network Equivalence – Part II: Multiterminal Channels , 2014, IEEE Transactions on Information Theory.
[6] D. Blackwell,et al. The Capacity of a Class of Channels , 1959 .
[7] R. Ahlswede. Elimination of correlation in random codes for arbitrarily varying channels , 1978 .
[8] Tracey Ho,et al. Network Error Correction With Unequal Link Capacities , 2010, IEEE Transactions on Information Theory.
[9] J. Wolfowitz. Coding Theorems of Information Theory , 1962, Ergebnisse der Mathematik und Ihrer Grenzgebiete.
[10] Imre Csiszár,et al. Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .
[11] Muriel Médard,et al. A Theory of Network Equivalence— Part I: Point-to-Point Channels , 2011, IEEE Transactions on Information Theory.
[12] Tracey Ho,et al. Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.