Cooperative Repair Schemes of Reed–Solomon Codes With Three Erasures
Ke Wang, Wenjie Ma · IEEE Communications Letters · 2025
Reed-Solomon (RS) codes are widely utilized in distributed storage systems, where multiple node failures occur occasionally. For the cooperative repair of [n,k] RS codes over Fqℓwith three erasures, existing schemes necessitaten−k≥qℓ−1, ℓ ≥ 4 and typically require three rounds of information interaction during the collaboration phase. This paper presents two key advancements. First, we develop an enhanced three-round cooperative repair scheme by using linearized polynomials corresponding to meticulously designed subspaces. Compared with the existing schemes, the proposed scheme maintains the same repair bandwidth while reducing the constraint ton−k≥qmwith an integerm∈ [3/4 ℓ, ℓ − 1], ℓ ≥ 4. Second, we refine the repair scheme to achieve one-round collaboration, albeit with a minor increase in the repair bandwidth.