A Construction of Systematic MDS Codes with Minimum Repair Bandwidth

Abstract

In a distributed storage system based on erasure coding, an important problem is the \emph{repair problem}: If a node storing a coded piece fails, in order to maintain the same level of reliability, we need to create a new encoded piece and store it at a new node. This paper presents a construction of systematic $(n,k)$-MDS codes for $2k\le n$ that achieves the minimum repair bandwidth when repairing from $k+1$ nodes.

Submitted to IEEE Transactions on Information Theory on August 14, 2009

Cited by in corpus (13)

• Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
• Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
• Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
• Exact Regeneration Codes for Distributed Storage Repair Using Interference Alignment
• Capacity and Security of Heterogeneous Distributed Storage Systems
• Enabling Node Repair in Any Erasure Code for Distributed Storage
• Minimum Storage Regenerating Codes For All Parameters
• Exact Scalar Minimum Storage Coordinated Regenerating Codes
• When and By How Much Can Helper Node Selection Improve Regenerating Codes?
• A Repair Framework for Scalar MDS Codes
• Quasi-cyclic Flexible Regenerating Codes
• A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems
• Optimal Construction of Regenerating Code through Rate-matching in Hostile Networks