loading...
Generalizing RDP Codes Using the Combinatorial Method
July 10-July 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NCA.2008.272008 Seventh IEEE International Sympo ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
In this paper, we present PDHLatin - a new class of 2-erasure horizontal codes with dependent parity symbols based on column-hamiltonian Latin squares (CHLS). We prove that PDHLatin 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.
Index Terms:
multi-erasure codes, RDP, graph representation, P1F, CHLS, code shortening
Citation:
Wang Gang, Liu Xiaoguang, Lin Sheng, Xie Guangjun, Liu Jing, "Generalizing RDP Codes Using the Combinatorial Method," nca, pp.93-100, 2008 Seventh IEEE International Symposium on Network Computing and Applications, 2008
Usage of this product signifies your acceptance of the Terms of Use.