A Family of Optimal Locally Recoverable Codes
From MaRDI portal
Abstract: A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the encoding is a function of a small number (at most ) other symbols. We present a family of LRC codes that attain the maximum possible value of the distance for a given locality parameter and code cardinality. The codewords are obtained as evaluations of specially constructed polynomials over a finite field, and reduce to a Reed-Solomon code if the locality parameter is set to be equal to the code dimension. The size of the code alphabet for most parameters is only slightly greater than the code length. The recovery procedure is performed by polynomial interpolation over points. We also construct codes with several disjoint recovering sets for every symbol. This construction enables the system to conduct several independent and simultaneous recovery processes of a specific symbol by accessing different parts of the codeword. This property enables high availability of frequently accessed data ("hot data").
Recommendations
- A construction of optimal locally recoverable codes
- Constructions of Locally Recoverable Codes Which are Optimal
- Bounds on the Parameters of Locally Recoverable Codes
- Explicit Maximally Recoverable Codes With Locality
- A characterization of optimal locally repairable codes
- Bounds on the size of locally recoverable codes
- Construction of optimal locally recoverable codes and connection with hypergraph
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Locally recoverable codes correcting many erasures over small fields
- New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
Cited in
(only showing first 100 items - show all)- Coding for locality in reconstructing permutations
- Anticode-based locally repairable codes with high availability
- Universal secure rank-metric coding schemes with optimal communication overheads
- Architecture-aware coding for distributed storage: repairable block failure resilient codes
- Locally recoverable codes from rational maps
- Locally recoverable \(J\)-affine variety codes
- RS-like locally recoverable codes with intersecting recovering sets
- Codes for distributed storage from 3-regular graphs
- Good polynomials for optimal LRC of low locality
- Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes
- The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
- On the locality of quasi-cyclic codes over finite fields
- 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
- Locally recoverable codes from algebraic curves with separated variables
- Linear programming bounds for distributed storage codes
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Codes with locality from cyclic extensions of Deligne-Lusztig curves
- The complete hierarchical locality of the punctured simplex code
- New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
- A new minimize matrix computation coding method for distributed storage systems
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- A new piggybacking design for systematic MDS storage codes
- Locality of optimal binary codes
- On binary locally repairable codes with distance four
- A class of almost MDS codes
- Optimal selection for good polynomials of degree up to five
- The minimum locality of linear codes
- 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
- Higher Hamming weights for locally recoverable codes on algebraic curves
- Maximally Recoverable Codes for Grid-like Topologies
- Constructions of \((r,t)\)-LRC based on totally isotropic subspaces in symplectic space over finite fields
- Locality via partially lifted codes
- scientific article; zbMATH DE number 7378653 (Why is no real title available?)
- Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- Toward good families of codes from towers of surfaces
- Construction of optimal locally recoverable codes and connection with hypergraph
- Integrated interleaved codes as locally recoverable codes: properties and performance
- Optimal binary linear locally repairable codes with disjoint repair groups
- The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes
- Relaxed locally correctable codes
- Rank-metric codes and their applications
- Codes for Distributed Storage
- Codes in the sum-rank metric: fundamentals and applications
- Lifted Multiplicity Codes and the Disjoint Repair Group Property
- A characterization of optimal locally repairable 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
- Some new classes of additive MDS and almost MDS codes over finite fields
- A characterization of optimal constacyclic locally repairable codes
- Private information retrieval from locally repairable databases with colluding servers
- Optimal binary and ternary locally repairable codes with minimum distance 6
- On Singleton-type bound of locally repairable codes
- Constacyclic locally recoverable codes from their duals
- Locally repairable codes with multiple repair sets based on packings of block size 4
- Number theoretical locally recoverable codes
- Optimal (r, )-LRCs from monomial-Cartesian codes and their subfield-subcodes
- Optimal ternary locally repairable codes
- The service rate region polytope
- Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
- On information-theoretic secure multiparty computation with local repairability
- On finding the largest minimum distance of locally recoverable codes: a graph theory approach
- Optimal (2, ) locally repairable codes via punctured simplex codes
- Some new constructions of optimal and almost optimal locally repairable codes
- Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials
- Easy repair via codes with simplex locality
- Locally recoverable algebro-geometric codes from projective bundles
- Weight distributions of two classes of optimal (r, )-locally repairable codes
- Good polynomials for locally recoverable codes: classification results, asymptotics, and exact formulae
- Double-twisted Reed-Solomon codes with twists (1, 3) and general hooks over finite fields
- A class of locally recoverable codes over finite chain rings
- 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
- Constructions of locally recoverable codes with large availability
- Lower rate bounds for Hermitian-lifted codes in odd prime characteristic
- A class of triple-twisted GRS codes
- Introducing locality in some generalized AG codes
- Pooled Testing for COVID-19 Using Coding Theory
- A family of self-orthogonal divisible codes with locality 2
- Optimal locally repairable codes with multiple repair sets based on 2-regular packings
- A construction of optimal quasi-cyclic locally recoverable codes using constituent codes
- Two families of optimal quantum locally recoverable codes
- LRC codes over characteristic 2
- Explicit constructions of optimal vector locally repairable codes
- Hull dimension of optimal binary LRCs with availability
- LRCS: duality, LP bounds, and field size
- Optimal quantum (r, )-locally repairable codes via classical ones
- Cyclic (r, ) locally recoverable codes from their constacyclic and negacyclic subcodes
- Optimal rank-metric codes with rank-locality from Drinfeld modules
- Binary t-divisible codes via simplicial complexes and their applications
- Locally recoverable codes with multiple recovering sets from maximal curves
- Locally recoverable codes with availability from a family of fibered surfaces
- Optimal RS-like LRC codes of arbitrary length
This page was built for publication: A Family of Optimal Locally Recoverable Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986212)
