A Construction of Systematic MDS Codes With Minimum Repair Bandwidth

doi:10.1109/TIT.2011.2134170

beta

A Construction of Systematic MDS Codes With Minimum Repair Bandwidth

Yunnan Wu

Oct 13, 2009

Citations

Journal

IEEE Transactions on Information Theory

Full text

Semantic Scholar

Key Takeaway

Key Takeaway: This paper presents a systematic (n,k)-MDS code construction for 2k n that achieves minimum repair bandwidth in distributed storage systems, maintaining reliability when repairing from k+1 nodes.

Abstract

In a distributed storage system based on erasure coding, an important problem is the 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 ≤ n that achieves the minimum repair bandwidth when repairing from k+1 nodes.

Text copied to clipboard

copied to clipboard