13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Combinatorial Constructions of Multi-erasure-Correcting Codes with Independent Parity Symbols for Storage Systems Melbourne, Victoria, Australia December 17-December 19 ISBN: 0-7695-3054-0
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PRDC.2007.9
In this paper, we present a new class of t-erasure horizontal codes with independent parity symbols based on Column-Hamiltonian Latin Squares (CHLS). We call the codes PIHLatin (Parity Independent Horizontal Latin) codes. We prove the necessary and sufficient condition of the existence of PIHLatin codes for t=2. For t3, we prove some necessary conditions of the existence of PIHLatin codes. We also prove the bijection between 2-erasure PIHLatin-like codes and CHLSs and prove the mapping from t-erasure PIHLatin-like codes to t-1 mutually orthogonal CHLSs for t>2. The performance analysis shows that PIHLatin codes are superior to other multi-erasure array codes in flexibility and variety. Moreover, PIHLatin codes are suitable for both traditional disk arrays and distributed storage systems. *
Citation:
Gang Wang, Sheng Lin, Xiaoguang Liu, Guangjun Xie, Jing Liu, "Combinatorial Constructions of Multi-erasure-Correcting Codes with Independent Parity Symbols for Storage Systems," prdc, pp.61-68, 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb