The complete hierarchical locality of the punctured simplex code
From MaRDI portal
Abstract: This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the complete list of possible localities is derived for a class of codes obtained by deleting specific columns from a Simplex code. This list is used to show that these codes are optimal codes with hierarchical locality.
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- A Family of Optimal Locally Recoverable Codes
- Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
- Anticode-based locally repairable codes with high availability
- Codes With Local Regeneration and Erasure Correction
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Locality and Availability in Distributed Storage
- On binary matroid minors and applications to data storage over small fields
- On the Combinatorics of Locally Repairable Codes via Matroid Theory
- On the Locality of Codeword Symbols
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
This page was built for publication: The complete hierarchical locality of the punctured simplex code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220763)