Construction of binary cooperative MSR codes with multiple repair degrees
From MaRDI portal
Cites work
- A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems
- Binary MDS Array Codes With Optimal Repair
- Constructing MSR Codes With Subpacketization 2 n/3 for k + 1 Helper Nodes
- Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
- Minimum Storage Regenerating Codes for All Parameters
- Network Coding for Distributed Storage Systems
- New array codes for multiple phased burst correction
- New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n))
- Polynomial Codes Over Certain Finite Fields
- Repair Optimal Erasure Codes Through Hadamard Designs
- Small-d MSR codes with optimal access, optimal sub-packetization, and linear field size
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
This page was built for publication: Construction of binary cooperative MSR codes with multiple repair degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955106)