Optimum Linear Codes with Support Constraints over Small Fields
暂无分享,去创建一个
[1] Alexander Sprintson,et al. Weakly secure data exchange with Generalized Reed Solomon codes , 2014, 2014 IEEE International Symposium on Information Theory.
[2] Babak Hassibi,et al. Further Progress on the GM-MDS Conjecture for Reed-Solomon Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[3] Chau Yuen,et al. On Simple Multiple Access Networks , 2015, IEEE Journal on Selected Areas in Communications.
[4] 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.
[5] Tracey Ho,et al. Distributed reed-solomon codes for simple multiple access networks , 2014, 2014 IEEE International Symposium on Information Theory.
[6] Wentu Song,et al. Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[7] Alexander Sprintson,et al. An algebraic-combinatorial proof technique for the GM-MDS conjecture , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[8] Alexander Sprintson,et al. Algorithms for weakly secure data exchange , 2013, 2013 International Symposium on Network Coding (NetCod).
[9] Babak Hassibi,et al. Balanced Reed-Solomon codes for all parameters , 2016, 2016 IEEE Information Theory Workshop (ITW).
[10] Babak Hassibi,et al. Balanced Reed-Solomon codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).