DocumentCode
2310426
Title
Generalizing RDP Codes Using the Combinatorial Method
Author
Gang, Wang ; Xiaoguang, Liu ; Sheng, Lin ; Guangjun, Xie ; Jing, Liu
Author_Institution
Dept. of Comput., Nankai Univ., Tianjin
fYear
2008
fDate
10-12 July 2008
Firstpage
93
Lastpage
100
Abstract
In this paper, we present PDH Latin - a new class of 2-erasure horizontal codes with dependent parity symbols based on column-Hamiltonian Latin squares (CHLS). We prove that PDH Latin codes are MDS codes. We also present a new class of 2-erasure parity independent mixed codes based on CHLS - PIMLatin. We show that the performance of the new codes is comparable to or better than other codes of this kind. They have perfect parameter flexibility and structure variety that benefit performance. We also discuss code shortening technologies that can improve parameter flexibility, structure variety and reliability. Borrowing ideas from vertical shortening, we develop a 2-erasure array code construction method using non-Hamiltonian Latin squares.
Keywords
codes; combinatorial mathematics; 2-erasure array code; 2-erasure horizontal codes; 2-erasure parity independent mixed codes; CHLS; MDS codes; PDH Latin codes; PIM Latin; RDP codes; column-Hamiltonian Latin squares; combinatorial method; dependent parity symbols; Application software; Computational complexity; Computer applications; Computer networks; Educational institutions; Galois fields; Hard disks; High performance computing; Linear code; Reed-Solomon codes; CHLS; P1F; RDP; code shortening; graph representation; multi-erasure codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Computing and Applications, 2008. NCA '08. Seventh IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
978-0-7695-3192-2
Electronic_ISBN
978-0-7695-3192-2
Type
conf
DOI
10.1109/NCA.2008.27
Filename
4579644
Link To Document