Explicit Maximally Recoverable Codes With Locality
From MaRDI portal
Publication:2986142
DOI10.1109/TIT.2014.2332338zbMath1360.94373arXiv1307.4150OpenAlexW2060646539MaRDI QIDQ2986142
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)
Full work available at URL: https://arxiv.org/abs/1307.4150
Related Items (18)
A construction of maximally recoverable codes ⋮ Tighter bounds on the independence number of the Birkhoff graph ⋮ Linear programming bounds for distributed storage codes ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Anticode-based locally repairable codes with high availability ⋮ Locally recoverable codes correcting many erasures over small fields ⋮ New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ Unnamed Item ⋮ Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups ⋮ Random construction of partial MDS codes ⋮ 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 ⋮ Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture ⋮ Rank-Metric Codes and Their Applications ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ Constructing Partial MDS Codes from Reducible Algebraic Curves
This page was built for publication: Explicit Maximally Recoverable Codes With Locality
