Balanced Reed-Solomon codes
暂无分享,去创建一个
[1] Alexander Sprintson,et al. Weakly Secure Network Coding for Wireless Cooperative Data Exchange , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.
[2] 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.
[3] Vinod M. Prabhakaran,et al. Decentralized erasure codes for distributed networked storage , 2006, IEEE Transactions on Information Theory.
[4] Mario Blaum,et al. On Lowest Density MDS Codes , 1999, IEEE Trans. Inf. Theory.
[5] Tracey Ho,et al. Distributed gabidulin codes for multiple-source network error correction , 2014, 2014 International Symposium on Network Coding (NetCod).
[6] Babak Hassibi,et al. Coding with constraints: Minimum distance bounds and systematic constructions , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[7] Tracey Ho,et al. Distributed reed-solomon codes for simple multiple access networks , 2014, 2014 IEEE International Symposium on Information Theory.
[8] Dimitris S. Papailiopoulos,et al. XORing Elephants: Novel Erasure Codes for Big Data , 2013, Proc. VLDB Endow..
[9] Frank R. Kschischang,et al. A Rank-Metric Approach to Error Control in Random Network Coding , 2007, IEEE Transactions on Information Theory.
[10] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[11] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[12] Itzhak Tamo,et al. A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.
[13] Frédérique E. Oggier,et al. RapidRAID: Pipelined erasure codes for fast data archival in distributed storage systems , 2013, 2013 Proceedings IEEE INFOCOM.
[14] Jehoshua Bruck,et al. EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.
[15] Cory Hill,et al. f4: Facebook's Warm BLOB Storage System , 2014, OSDI.
[16] F. Moore,et al. Polynomial Codes Over Certain Finite Fields , 2017 .
[17] Jehoshua Bruck,et al. Low-density MDS codes and factors of complete graphs , 1998, IEEE Trans. Inf. Theory.
[18] Robert J. McEliece,et al. The Theory of Information and Coding , 1979 .
[19] Chau Yuen,et al. Constructions of MDS codes via random Vandermonde and Cauchy matrices over small fields , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[20] Ron M. Roth,et al. Lowest density MDS codes over extension alphabets , 2003, IEEE Transactions on Information Theory.
[21] Alexander Sprintson,et al. Weakly secure data exchange with Generalized Reed Solomon codes , 2014, 2014 IEEE International Symposium on Information Theory.
[22] Chau Yuen,et al. Balanced Sparsest generator matrices for MDS codes , 2013, 2013 IEEE International Symposium on Information Theory.
[23] Babak Hassibi,et al. Balanced and sparse Tamo-Barg codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[24] International Symposium on Network Coding, NetCod 2014, Aalborg Oest, Denmark, June 27-28, 2014 , 2014, NetCod.
[25] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[26] Cheng Huang,et al. On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.
[27] Chau Yuen,et al. On Simple Multiple Access Networks , 2015, IEEE Journal on Selected Areas in Communications.