Bounds on the Parameters of Locally Recoverable Codes
From MaRDI portal
Abstract: A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recovering set. In this paper we derive new finite-length and asymptotic bounds on the parameters of LRC codes. For LRC codes with a single recovering set for every coordinate, we derive an asymptotic Gilbert-Varshamov type bound for LRC codes and find the maximum attainable relative distance of asymptotically good LRC codes. Similar results are established for LRC codes with two disjoint recovering sets for every coordinate. For the case of multiple recovering sets we derive a lower bound on the parameters using expander graph arguments. Finally, we also derive finite-length upper bounds on the rate and distance of LRC codes with multiple recovering sets.
Cited in
(33)- Locally recoverable \(J\)-affine variety codes
- RS-like locally recoverable codes with intersecting recovering sets
- Locally repairable codes with high availability based on generalised quadrangles
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves
- A Family of Optimal Locally Recoverable Codes
- Limits on the Rate of Locally Testable Affine-Invariant Codes
- Local asymptotic coding and the minimum description length
- Limitation on the Rate of Families of Locally Testable Codes
- Locality via partially lifted codes
- scientific article; zbMATH DE number 7376033 (Why is no real title available?)
- Integrated interleaved codes as locally recoverable codes: properties and performance
- A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
- Automata, Languages and Programming
- Codes for Distributed Storage
- Lifted Multiplicity Codes and the Disjoint Repair Group Property
- A characterization of optimal locally repairable codes
- New upper bounds and constructions of multi-erasure locally recoverable codes
- Locally recoverable codes from towers of function fields
- On Singleton-type bound of locally repairable codes
- Locally repairable codes with multiple repair sets based on packings of block size 4
- Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
- On finding the largest minimum distance of locally recoverable codes: a graph theory approach
- Some new constructions of optimal and almost optimal locally repairable codes
- Locally recoverable algebro-geometric codes from projective bundles
- Bounds on the size of (r,)-locally repairable codes for fixed values q and d
- Introducing locality in some generalized AG codes
- Optimal locally repairable codes with multiple repair sets based on 2-regular packings
- Two families of optimal quantum locally recoverable codes
- Optimal rank-metric codes with rank-locality from Drinfeld modules
- 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: Bounds on the Parameters of Locally Recoverable Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976756)
