On the equivalence between the B-Code constructions and perfect one-factorizations

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...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Symposium on Information Theory pp. 993 - 996
Main Authors Mingqiang Li, Jiwu Shu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Computer science
Decoding
Encoding
Fault tolerant systems
Graph theory
Information science
Laboratories
Redundancy
Reed-Solomon codes
Research and development
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9781424478903
1424478901
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2010.5513748