HVD code: a class of MDS array codes for tolerating triple disk failures
暂无分享,去创建一个
[1] Hong Jiang,et al. XI-Code: A Family of Practical Lowest Density MDS Array Codes of Distance 4 , 2016, IEEE Transactions on Communications.
[2] Mario Blaum,et al. On Lowest Density MDS Codes , 1999, IEEE Trans. Inf. Theory.
[3] Jehoshua Bruck,et al. X-Code: MDS Array Codes with Optimal Encoding , 1999, IEEE Trans. Inf. Theory.
[4] Jiwu Shu,et al. HV Code: An All-Around MDS Code for RAID-6 Storage Systems , 2016, IEEE Transactions on Parallel and Distributed Systems.
[5] Cheng Huang,et al. STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures , 2005, IEEE Transactions on Computers.
[6] Gang Wang,et al. T-Code: 3-Erasure Longest Lowest-Density MDS Codes , 2010, IEEE Journal on Selected Areas in Communications.
[7] G.-L. Feng,et al. New efficient MDS array codes for RAID. Part II. Rabin-like codes for tolerating multiple (/spl ges/ 4) disk failures , 2005, IEEE Transactions on Computers.
[8] Jehoshua Bruck,et al. EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.
[9] I. Reed,et al. Polynomial Codes Over Certain Finite Fields , 1960 .
[10] Alexander Vardy,et al. MDS array codes with independent parity symbols , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.