Distributed reed-solomon codes for simple multiple access networks
暂无分享,去创建一个
[1] Chau Yuen,et al. On the existence of MDS codes over small fields with constrained generator matrices , 2014, 2014 IEEE International Symposium on Information Theory.
[2] I. Reed,et al. Polynomial Codes Over Certain Finite Fields , 1960 .
[3] Alexander Sprintson,et al. Weakly Secure Network Coding for Wireless Cooperative Data Exchange , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.
[4] Andrei V. Kelarev,et al. The Theory of Information and Coding , 2005 .
[5] Robert J. McEliece,et al. The Theory of Information and Coding , 1979 .
[6] Tracey Ho,et al. Key agreement for wireless networks in the presence of active adversaries , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).
[7] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..
[8] Sidharth Jaggi,et al. Multiple-Access Network Information-Flow and Correction Codes , 2010, IEEE Transactions on Information Theory.
[9] Alexander Sprintson,et al. Weakly secure data exchange with Generalized Reed Solomon codes , 2014, 2014 IEEE International Symposium on Information Theory.
[10] Chau Yuen,et al. Balanced Sparsest generator matrices for MDS codes , 2013, 2013 IEEE International Symposium on Information Theory.
[11] Alexander Sprintson,et al. On coding for cooperative data exchange , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).