Explicit constructions of optimal vector locally repairable codes
From MaRDI portal
Cites work
- A Family of Optimal Locally Recoverable Codes
- A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
- A Systematic Construction of MDS Codes With Small Sub-Packetization Level and Near-Optimal Repair Bandwidth
- Bounds and constructions of quantum locally recoverable codes from quantum CSS 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
- Locally Repairable Codes
- MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
- Network Coding for Distributed Storage Systems
- On the Combinatorics of Locally Repairable Codes via Matroid Theory
- On the Locality of Codeword Symbols
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Optimal Locally Repairable Codes: An Improved Bound and Constructions
- Repairing Reed-Solomon Codes
- ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair
This page was built for publication: Explicit constructions of optimal vector locally repairable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229391)