A New Class of MDS Erasure Codes Based on Graphs

Details A New Class of MDS Erasure Codes Based on Graphs A New Class of MDS Erasure Codes Based on Graphs

2011-05-09

arxiv.org/abs/1105.1562v1

Computer Science

Information Theory

in Proceeding of IEEE Global Communications Conference (GLOBECOM)

Scientific paper

Maximum distance separable (MDS) array codes are XOR-based optimal erasure codes that are particularly suitable for use in disk arrays. This paper develops an innovative method to build MDS array codes from an elegant class of nested graphs, termed \textit{complete-graph-of-rings (CGR)}. We discuss a systematic and concrete way to transfer these graphs to array codes, unveil an interesting relation between the proposed map and the renowned perfect 1-factorization, and show that the proposed CGR codes subsume B-codes as their "contracted" codes. These new codes, termed \textit{CGR codes}, and their dual codes are simple to describe, and require minimal encoding and decoding complexity.

Affiliated with

Also associated with

No associations

Rating

A New Class of MDS Erasure Codes Based on Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Class of MDS Erasure Codes Based on Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Class of MDS Erasure Codes Based on Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333148