A Family of Optimal Locally Recoverable Codes
From MaRDI portal
Publication:2986212
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
(75)- Coding theory package for Macaulay2
- Codes for Distributed Storage
- Locally recoverable codes from algebraic curves with separated variables
- Universal secure rank-metric coding schemes with optimal communication overheads
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- The complete hierarchical locality of the punctured simplex code
- The minimum locality of linear codes
- A new piggybacking design for systematic MDS storage codes
- Locally recoverable codes from towers of function fields
- A characterization of optimal locally repairable codes
- On the locality of quasi-cyclic codes over finite fields
- Locally repairable codes with multiple repair sets based on packings of block size 4
- scientific article; zbMATH DE number 7561591 (Why is no real title available?)
- New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
- Higher Hamming weights for locally recoverable codes on algebraic curves
- Coding for locality in reconstructing permutations
- Codes for distributed storage from 3-regular graphs
- Number theoretical locally recoverable codes
- RS-like locally recoverable codes with intersecting recovering sets
- Optimal binary linear locally repairable codes with disjoint repair groups
- New upper bounds and constructions of multi-erasure locally recoverable codes
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
- New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
- Optimal \((r,\delta )\)-LRCs from monomial-Cartesian codes and their subfield-subcodes
- Optimal ternary locally repairable codes
- Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
- The service rate region polytope
- Optimal cyclic locally repairable codes with unbounded length from their zeros
- The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes
- Good polynomials for optimal LRC of low locality
- A function field approach toward good polynomials for further results on optimal LRC codes
- Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Architecture-aware coding for distributed storage: repairable block failure resilient codes
- Relaxed locally correctable codes
- Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
- Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes
- Some new classes of additive MDS and almost MDS codes over finite fields
- On binary locally repairable codes with distance four
- On information-theoretic secure multiparty computation with local repairability
- Lifted Multiplicity Codes and the Disjoint Repair Group Property
- A class of almost MDS codes
- A characterization of optimal constacyclic locally repairable codes
- Constructions of \((r,t)\)-LRC based on totally isotropic subspaces in symplectic space over finite fields
- Toward good families of codes from towers of surfaces
- Optimal RS-like LRC codes of arbitrary length
- Optimal selection for good polynomials of degree up to five
- Codes in the sum-rank metric: fundamentals and applications
- On finding the largest minimum distance of locally recoverable codes: a graph theory approach
- Linear programming bounds for distributed storage codes
- Maximally Recoverable Codes for Grid-like Topologies
- Computing sharp recovery structures for locally recoverable codes
- Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
- Rank-metric codes and their applications
- Locality of optimal binary codes
- Optimal \((2, \delta)\) locally repairable codes via punctured simplex codes
- Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials
- Some new constructions of optimal and almost optimal locally repairable codes
- Private information retrieval from locally repairable databases with colluding servers
- Optimal binary and ternary locally repairable codes with minimum distance 6
- A new minimize matrix computation coding method for distributed storage systems
- Anticode-based locally repairable codes with high availability
- Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
- scientific article; zbMATH DE number 7378653 (Why is no real title available?)
- Locality via partially lifted 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
- The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
- On Singleton-type bound of locally repairable codes
- Integrated interleaved codes as locally recoverable codes: properties and performance
- Locally recoverable \(J\)-affine variety codes
- Codes with locality from cyclic extensions of Deligne-Lusztig curves
- Locally recoverable codes from rational maps
- Constacyclic locally recoverable codes from their duals
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)
