Skip to main content
Article thumbnail
Location of Repository

A New Class of MDS Erasure Codes Based on Graphs

By Nattakan Puttarak, Phisan Kaewprapha, Boon Chong Ng, Jing and Li

Abstract

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.Comment: in Proceeding of IEEE Global Communications Conference (GLOBECOM

Topics: Computer Science - Information Theory
Year: 2011
DOI identifier: 10.1109/GLOCOM.2009.5426134
OAI identifier: oai:arXiv.org:1105.1562
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1105.1562 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.