DocumentCode :
2901272
Title :
Representing X-Code Using Latin Squares
Author :
Wang, Gang ; Lin, Sheng ; Liu, Xiaoguang ; Liu, Jing
Author_Institution :
Nankai-Baidu Joint Lab., Nankai Univ., Tianjin, China
fYear :
2009
fDate :
16-18 Nov. 2009
Firstpage :
177
Lastpage :
182
Abstract :
X-code is an important 2-erasure correcting vertical array code. In this paper, we present a combinatorial representation for X-code. It is based on graph representation of binary linear/array codes. We represent X-code by Cayley tables of the cyclic groups of prime order - a special column-Hamiltonian Latin squares (CHLS). This representation is helpful to comprehend X-code´s 2-erasure correcting ability. We also show the inner relationship between X-code and the liberation codes though the former is a vertical code and the latter is a horizontal code. A possible way to construct the 2-erasure vertical codes like X-code using common CHLS is also proposed.
Keywords :
binary codes; Cayley tables; Liberation codes; X-code representation; binary linear-array codes; column-Hamiltonian Latin squares; combinatorial representation; graph representation; latin squares; vertical array code; Computational complexity; Decoding; Educational institutions; Encoding; Galois fields; Hard disks; Information technology; Linear code; Reed-Solomon codes; Research and development; CHLS; Liberation code; P1F; X-Code; multi-erasure codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Dependable Computing, 2009. PRDC '09. 15th IEEE Pacific Rim International Symposium on
Conference_Location :
Shanghai
Print_ISBN :
978-0-7695-3849-5
Type :
conf
DOI :
10.1109/PRDC.2009.36
Filename :
5368514
Link To Document :
بازگشت