Representing X-Code Using Latin Squares
暂无分享,去创建一个
[1] J. Plank. Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Storage Applications , 2005 .
[2] Peter F. Corbett,et al. Row-Diagonal Parity for Double Disk Failure Correction (Awarded Best Paper!) , 2004, USENIX Conference on File and Storage Technologies.
[3] Ian M. Wanless. Perfect Factorisations of Bipartite Graphs and Latin Squares Without Proper Subrectangles , 1999, Electron. J. Comb..
[4] Jehoshua Bruck,et al. X-Code: MDS Array Codes with Optimal Encoding , 1999, IEEE Trans. Inf. Theory.
[5] James S. Plank,et al. A practical analysis of low-density parity-check erasure codes for wide-area storage applications , 2004, International Conference on Dependable Systems and Networks, 2004.
[6] James S. Plank. The RAID-6 Liberation Codes , 2008, FAST.
[7] Zhou Jie. The Study of Graph Decompositions and Placement of Parity and Data to Tolerate Two Failures in Disk Arrays: Conditions and Existance , 2003 .
[8] Randy H. Katz,et al. Coding techniques for handling failures in large disk arrays , 2005, Algorithmica.
[9] Jehoshua Bruck,et al. EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.
[10] James S. Plank,et al. A tutorial on Reed–Solomon coding for fault‐tolerance in RAID‐like systems , 1997, Softw. Pract. Exp..
[11] Liu Jing,et al. Constructing Liberation Codes Using Latin Squares , 2008, 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing.