Explicit Maximally Recoverable Codes With Locality
From MaRDI portal
Publication:2986142
DOI10.1109/TIT.2014.2332338zbMATH Open1360.94373arXiv1307.4150OpenAlexW2060646539MaRDI QIDQ2986142FDOQ2986142
Sergey Yekhanin, Parikshit Gopalan, Bob Jenkins, Cheng Huang
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1307.4150
Cited In (23)
- Codes for Distributed Storage
- The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes
- Theory of supports for linear codes endowed with the sum-rank metric
- New upper bounds and constructions of multi-erasure locally recoverable codes
- New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
- Codes in the Sum-Rank Metric: Fundamentals and Applications
- Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture
- A construction of maximally recoverable codes
- Random construction of partial MDS codes
- Tighter bounds on the independence number of the Birkhoff graph
- Rank-Metric Codes and Their Applications
- Locally maximal recoverable codes and LMR-LCD codes
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- Title not available (Why is that?)
- A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices
- Maximally Recoverable Codes for Grid-like Topologies
- Linear programming bounds for distributed storage codes
- Private information retrieval from locally repairable databases with colluding servers
- A Family of Optimal Locally Recoverable Codes
- Anticode-based locally repairable codes with high availability
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups
- Locally recoverable \(J\)-affine variety codes
- Locally recoverable codes correcting many erasures over small fields
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)
