A Construction of Systematic MDS Codes with Minimum Repair Bandwidth
Yunnan Wu
TL;DR
This paper introduces a systematic construction of MDS codes for distributed storage that minimizes repair bandwidth when repairing from a specific number of nodes, improving efficiency in data recovery.
Contribution
It provides a new construction of systematic (n,k)-MDS codes with optimal repair bandwidth for the case 2k ≤ n, advancing coding efficiency in distributed storage.
Findings
Achieves minimum repair bandwidth for specific code parameters
Constructs systematic (n,k)-MDS codes with optimal repair properties
Applicable to distributed storage systems requiring efficient node repair
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 -MDS codes for that achieves the minimum repair bandwidth when repairing from nodes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.