A class of minimum storage cooperative regenerating codes with low access property
From MaRDI portal
Publication:6112194
DOI10.3934/amc.2022084zbMath1521.94087arXiv2201.06236OpenAlexW4312800967MaRDI QIDQ6112194
Xing Lin, Xiaohu Tang, Han Cai
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.06236
distributed storagemultiple-node repaircooperative repairlow accessminimum storage regenerating code
Cites Work
- Explicit Minimum Storage Regenerating Codes
- A Framework of Constructions of Minimal Storage Regenerating Codes With the Optimal Access/Update Property
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
- Repair Optimal Erasure Codes Through Hadamard Designs
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
- Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing
- Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
- A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems
- Network Coding for Distributed Storage Systems
- New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n))
- Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model
- Scalar MSCR Codes via the Product Matrix Construction
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
- Cooperative Regenerating Codes
This page was built for publication: A class of minimum storage cooperative regenerating codes with low access property
