DocumentCode
3070440
Title
On the equivalence between the B-Code constructions and perfect one-factorizations
Author
Li, Mingqiang ; Shu, Jiwu
Author_Institution
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
fYear
2010
fDate
13-18 June 2010
Firstpage
993
Lastpage
996
Abstract
The B-Code is a class of MDS array code with optimal properties for RAID 6. Xu et al. proposed an open problem in 1999: Are the B-Code constructions strongly equivalent to perfect one-factorizations of a graph? In this paper, we show that the constructions of the B-Code of length l are equivalent to perfect one-factorizations of a l-regular graph on l + r vertices, where l is an integer not smaller than 4, and r is equal to 1 for an odd l or 2 for an even l.
Keywords
RAID; codes; graph theory; B-code constructions; MDS array code; RAID; l-regular graph; perfect one-factorizations; Computer science; Decoding; Encoding; Fault tolerant systems; Graph theory; Information science; Laboratories; Redundancy; Reed-Solomon codes; Research and development;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location
Austin, TX
Print_ISBN
978-1-4244-7890-3
Electronic_ISBN
978-1-4244-7891-0
Type
conf
DOI
10.1109/ISIT.2010.5513748
Filename
5513748
Link To Document