Optimal Locally Repairable Codes and Connections to Matroid Theory

DOI10.1109/TIT.2016.2555813zbMath1359.94737arXiv1301.7693MaRDI QIDQ2976387

Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.7693

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (20)

Optimal cyclic locally repairable codes with unbounded length from their zeros ⋮ Linear programming bounds for distributed storage codes ⋮ A characterization of optimal locally repairable codes ⋮ Parametric matroid interdiction ⋮ Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes ⋮ Unnamed Item ⋮ Perfect LRCs and \(k\)-optimal LRCs ⋮ Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification ⋮ New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ RS-like locally recoverable codes with intersecting recovering sets ⋮ Unnamed Item ⋮ Good polynomials for optimal LRC of low locality ⋮ Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups ⋮ Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length ⋮ Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields ⋮ Optimal RS-like LRC codes of arbitrary length ⋮ The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes ⋮ 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: Optimal Locally Repairable Codes and Connections to Matroid Theory