New centralized multi-node repair schemes for distributed storage
From MaRDI portal
Cites work
- A generic transformation to enable optimal repair/access MDS array codes with multiple repair degrees
- A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization
- A Systematic Construction of MDS Codes With Small Sub-Packetization Level and Near-Optimal Repair Bandwidth
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
- Centralized Multi-Node Repair Regenerating Codes
- Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
- 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 Minimum Storage Regenerating Codes
- scientific article; zbMATH DE number 1243360 (Why is no real title available?)
- MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
- Network Coding for Distributed Storage Systems
- New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n))
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Optimal Rebuilding of Multiple Erasures in MDS Codes
- Optimal repair of Reed-Solomon codes: achieving the cut-set bound
- Repairing Multiple Failures for Scalar MDS Codes
- Repairing Reed-Solomon Codes
- Repairing Reed-Solomon Codes With Multiple Erasures
- Scalar MSCR codes via the product matrix construction
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
- ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair
This page was built for publication: New centralized multi-node repair schemes for distributed storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892142)
