Distributed repairing multiple erasures in Reed-Solomon codes

DOI10.1007/S12095-025-00845-ZMaRDI QIDQ7229394zbMATH OpenFDO

Authors Xing Lin

Publication date 15 April 2026

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12095-025-00845-Z

zbMATH Keywords

distributed repair schemesdistributed storage systemsmultiple erasuresReed-Solomon codesrepair bandwidth

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Cites work

• Constructing MSR Codes With Subpacketization 2 ^n/3 for k + 1 Helper Nodes
• Cooperative repair of Reed-Solomon codes via linearized permutation polynomials
• Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes
• Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
• Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
• Explicit low-bandwidth evaluation schemes for weighted sums of Reed-Solomon-coded symbols
• Explicit Minimum Storage Regenerating Codes
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Improved Schemes for Asymptotically Optimal Repair of MDS Codes
• Network Coding for Distributed Storage Systems
• Nonlinear Repair of Reed-Solomon Codes
• On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes
• Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
• Optimal repair of Reed-Solomon codes: achieving the cut-set bound
• Polynomial Codes Over Certain Finite Fields
• Repair Optimal Erasure Codes Through Hadamard Designs
• Repairing Multiple Failures for Scalar MDS Codes
• Repairing Reed-Solomon Codes
• Repairing Reed-Solomon Codes via Subspace Polynomials
• Repairing Reed-Solomon Codes With Multiple Erasures
• Repairing Reed–Solomon Codes Evaluated on Subspaces
• Small-d MSR codes with optimal access, optimal sub-packetization, and linear field size
• The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
• Zigzag Codes: MDS Array Codes With Optimal Rebuilding

This page was built for publication: Distributed repairing multiple erasures in Reed-Solomon codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229394)