MDS array codes with efficient repair and small sub-packetization level
From MaRDI portal
Recommendations
- MDS code constructions with small sub-packetization and near-optimal repair bandwidth
- Explicit constructions of MSR codes for clustered distributed storage: the rack-aware storage model
- Codes for Distributed Storage
- A study of the performance of novel storage-centric repairable codes
- Clay and product-matrix MSR codes with locality
Cites work
- scientific article; zbMATH DE number 53946 (Why is no real title available?)
- A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems
- A New Design of Binary MDS Array Codes With Asymptotically Weak-Optimal Repair
- A generic transformation to enable optimal repair/access MDS array codes with multiple repair degrees
- Access Versus Bandwidth in Codes for Storage
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
- Constructing MSR Codes With Subpacketization 2 n/3 for k + 1 Helper Nodes
- Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
- MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
- Network Coding for Distributed Storage Systems
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Polynomial Codes Over Certain Finite Fields
- 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: MDS array codes with efficient repair and small sub-packetization level
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632062)
