Balanced Reed-Solomon codes for all parameters
暂无分享,去创建一个
[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] Chau Yuen,et al. Balanced Sparsest generator matrices for MDS codes , 2013, 2013 IEEE International Symposium on Information Theory.
[3] Babak Hassibi,et al. Coding with constraints: Minimum distance bounds and systematic constructions , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[4] Chau Yuen,et al. On Simple Multiple Access Networks , 2015, IEEE Journal on Selected Areas in Communications.
[5] Robert McEliece,et al. The Theory of Information and Coding: Information theory , 2002 .
[6] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[7] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[8] F. Moore,et al. Polynomial Codes Over Certain Finite Fields , 2017 .
[9] Vinod M. Prabhakaran,et al. Decentralized erasure codes for distributed networked storage , 2006, IEEE Transactions on Information Theory.
[10] Tracey Ho,et al. Distributed gabidulin codes for multiple-source network error correction , 2014, 2014 International Symposium on Network Coding (NetCod).
[11] Babak Hassibi,et al. Balanced Reed-Solomon codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[12] Tracey Ho,et al. Distributed reed-solomon codes for simple multiple access networks , 2014, 2014 IEEE International Symposium on Information Theory.