Security for wiretap networks via rank-metric codes
暂无分享,去创建一个
[1] Emina Soljanin,et al. On Wiretap Networks II , 2007, 2007 IEEE International Symposium on Information Theory.
[2] Pierre Loidreau,et al. Properties of codes in rank metric , 2006, ArXiv.
[3] Jon Feldman,et al. On the Capacity of Secure Network Coding , 2004 .
[4] Muriel Médard,et al. An algebraic approach to network coding , 2003, TNET.
[5] Frank R. Kschischang,et al. A Rank-Metric Approach to Error Control in Random Network Coding , 2007, IEEE Transactions on Information Theory.
[6] Maximilien Gadouleau,et al. GENp1-1: Properties of Codes with the Rank Metric , 2006, IEEE Globecom 2006.
[7] R. Yeung,et al. Secure network coding , 2002, Proceedings IEEE International Symposium on Information Theory,.
[8] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[9] Peter Sanders,et al. Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.
[10] Lawrence H. Ozarow,et al. Wire-tap channel II , 1984, AT&T Bell Lab. Tech. J..
[11] Frank R. Kschischang,et al. Using Rank-Metric Codes for Error Correction in Random Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.
[12] Ron M. Roth,et al. Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction' , 1991, IEEE Trans. Inf. Theory.
[13] T. Ho,et al. On Linear Network Coding , 2010 .
[14] Simon Plass,et al. Error and Erasure Decoding of Rank-Codes with a Modified Berlekamp-Massey Algorithm , 2004 .