Balanced and sparse Tamo-Barg codes
暂无分享,去创建一个
Babak Hassibi | Hoang Dau | Iwan M. Duursma | Wael Halbawi | B. Hassibi | I. Duursma | Hoang Dau | Wael Halbawi
[1] Dimitris S. Papailiopoulos,et al. Optimal locally repairable codes and connections to matroid theory , 2013, 2013 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] Sriram Vishwanath,et al. Optimal locally repairable codes via rank-metric codes , 2013, 2013 IEEE International Symposium on Information Theory.
[4] Dimitris S. Papailiopoulos,et al. Locally Repairable Codes , 2014, IEEE Trans. Inf. Theory.
[5] Robert McEliece,et al. The Theory of Information and Coding: Information theory , 2002 .
[6] Frédérique Oggier,et al. Self-repairing homomorphic codes for distributed storage systems , 2010, 2011 Proceedings IEEE INFOCOM.
[7] Babak Hassibi,et al. Balanced Reed-Solomon codes for all parameters , 2016, 2016 IEEE Information Theory Workshop (ITW).
[8] Minghua Chen,et al. Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).
[9] Itzhak Tamo,et al. A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.
[10] Chau Yuen,et al. Optimal Locally Repairable Linear Codes , 2014, IEEE Journal on Selected Areas in Communications.
[11] Cheng Huang,et al. On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.
[12] Babak Hassibi,et al. Balanced Reed-Solomon codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[13] A. Robert Calderbank,et al. Cyclic LRC codes and their subfield subcodes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[14] P. Vijay Kumar,et al. Codes With Local Regeneration and Erasure Correction , 2014, IEEE Transactions on Information Theory.