PMDS Array Codes With Small Sub-packetization, Small Repair Bandwidth/Rebuilding Access
Jie Li, Xiaohu Tang, Hanxu Hou, Yunghsiang S. Han, Bo Bai, and Gong, Zhang

TL;DR
This paper introduces new PMDS array code constructions that achieve smaller sub-packetization levels and reduced repair bandwidth and rebuilding access, improving efficiency for data recovery in distributed storage systems.
Contribution
The paper presents two novel PMDS array code constructions with two global parities, supporting arbitrary local parities with near-optimal repair bandwidth and reduced sub-packetization, plus a three-global parity code with similar benefits.
Findings
Supports arbitrary local parities with near-optimal repair bandwidth
Achieves significantly smaller sub-packetization levels
Requires smaller finite fields than existing codes
Abstract
Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the nodes are divided into multiple groups with each forming an MDS code with a smaller code length, thus they allow repairing a failed node with only a few helper nodes and can correct all erasure patterns that are information-theoretically correctable. However, the repair of a failed node of PMDS codes still requires a large amount of communication if the group size is large. Recently, PMDS array codes with each local code being an MSR code were introduced to reduce the repair bandwidth further. However, they require extensive rebuilding access and unavoidably a significant sub packetization level. In this paper, we first propose two constructions of PMDS array codes with two global parities that have smaller sub-packetization levels and much smaller finite fields than the existing one. One construction…
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.
