Optimal array codes with hierarchical locality
From MaRDI portal
Cites work
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Codes With Hierarchical Locality From Covering Maps of Curves
- Codes With Local Regeneration and Erasure Correction
- Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory
- Constructions of Optimal Codes With Hierarchical Locality
- Cyclic and Convolutional Codes With Locality
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes
- How Long Can Optimal Locally Repairable Codes Be?
- scientific article; zbMATH DE number 1284435 (Why is no real title available?)
- Locality and Availability of Array Codes Constructed From Subspaces
- Maximally Recoverable Codes With Hierarchical Locality: Constructions and Field-Size Bounds
- MDS array codes with independent parity symbols
- New array codes for multiple phased burst correction
- New constructions of MDS array codes and optimal locally repairable array codes
- New Constructions of Optimal Locally Repairable Codes With Super-Linear Length
- New Optimal Linear Codes With Hierarchical Locality
- On the Locality of Codeword Symbols
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Polynomial Codes Over Certain Finite Fields
- STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- X-code: MDS array codes with optimal encoding
This page was built for publication: Optimal array codes with hierarchical locality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229396)
