Explicit Maximally Recoverable Codes With Locality
From MaRDI portal
Abstract: Consider a systematic linear code where some (local) parity symbols depend on few prescribed symbols, while other (heavy) parity symbols may depend on all data symbols. Local parities allow to quickly recover any single symbol when it is erased, while heavy parities provide tolerance to a large number of simultaneous erasures. A code as above is maximally-recoverable if it corrects all erasure patterns which are information theoretically recoverable given the code topology. In this paper we present explicit families of maximally-recoverable codes with locality. We also initiate the study of the trade-off between maximal recoverability and alphabet size.
Cited in
(26)- Anticode-based locally repairable codes with high availability
- Locally recoverable codes correcting many erasures over small fields
- Locally recoverable \(J\)-affine variety codes
- A construction of maximally recoverable codes
- Tighter bounds on the independence number of the Birkhoff graph
- Linear programming bounds for distributed storage codes
- New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
- Random construction of partial MDS codes
- Theory of supports for linear codes endowed with the sum-rank metric
- A Family of Optimal Locally Recoverable Codes
- Maximally Recoverable Codes for Grid-like Topologies
- Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- Constructions of maximally recoverable local reconstruction codes via function fields
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- Optimal binary linear locally repairable codes with disjoint repair groups
- The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes
- Rank-metric codes and their applications
- Codes for Distributed Storage
- Codes in the sum-rank metric: fundamentals and applications
- New upper bounds and constructions of multi-erasure locally recoverable codes
- Private information retrieval from locally repairable databases with colluding servers
- Locally maximal recoverable codes and LMR-LCD codes
- Bounds on the size of (r,)-locally repairable codes for fixed values q and d
- A new construction of maximally recoverable codes with hierarchical locality
- Locally maximal recoverable codes with unequal localities and LMR codes with hierarchical locality
This page was built for publication: Explicit Maximally Recoverable Codes With Locality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986142)
