A Family of Optimal Locally Recoverable Codes
From MaRDI portal
Publication:2986212
DOI10.1109/TIT.2014.2321280zbMath1360.94385arXiv1311.3284OpenAlexW1997044393MaRDI QIDQ2986212
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/1311.3284
LRC codescode cardinalitycodes with several disjoint recovering setslocality parametermaximum possible value of distance
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (57)
Higher Hamming weights for locally recoverable codes on algebraic curves ⋮ Toward good families of codes from towers of surfaces ⋮ Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes ⋮ A function field approach toward good polynomials for further results on optimal LRC codes ⋮ Coding theory package for Macaulay2 ⋮ Optimal cyclic locally repairable codes with unbounded length from their zeros ⋮ On binary locally repairable codes with distance four ⋮ Locality via Partially Lifted Codes ⋮ Locality of optimal binary codes ⋮ Locally recoverable codes from algebraic curves with separated variables ⋮ Linear programming bounds for distributed storage codes ⋮ A class of almost MDS codes ⋮ Unnamed Item ⋮ Optimal selection for good polynomials of degree up to five ⋮ A characterization of optimal locally repairable codes ⋮ The minimum locality of linear codes ⋮ Near MDS codes of non-elliptic-curve type from Reed-Solomon codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes ⋮ Locally recoverable codes from towers of function fields ⋮ New constructions of optimal \((r, \delta)\)-LRCs via good polynomials ⋮ Coding for locality in reconstructing permutations ⋮ Anticode-based locally repairable codes with high availability ⋮ Some new classes of additive MDS and almost MDS codes over finite fields ⋮ Constructions of optimal locally recoverable codes via Dickson polynomials ⋮ Codes with locality from cyclic extensions of Deligne-Lusztig curves ⋮ A characterization of optimal constacyclic locally repairable codes ⋮ Unnamed Item ⋮ Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification ⋮ Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves ⋮ The complete hierarchical locality of the punctured simplex code ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ RS-like locally recoverable codes with intersecting recovering sets ⋮ Codes for distributed storage from 3-regular graphs ⋮ Unnamed Item ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Good polynomials for optimal LRC of low locality ⋮ Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups ⋮ Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes ⋮ Locally recoverable codes from rational maps ⋮ A new minimize matrix computation coding method for distributed storage systems ⋮ 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 ⋮ The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes ⋮ Optimal RS-like LRC codes of arbitrary length ⋮ Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes ⋮ Computing sharp recovery structures for locally recoverable codes ⋮ The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes ⋮ Lifted Multiplicity Codes and the Disjoint Repair Group Property ⋮ A new piggybacking design for systematic MDS storage codes ⋮ 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 ⋮ On the locality of quasi-cyclic codes over finite fields
This page was built for publication: A Family of Optimal Locally Recoverable Codes
