Bounds on the Parameters of Locally Recoverable Codes
From MaRDI portal
Publication:2976756
DOI10.1109/TIT.2016.2518663zbMATH Open1359.94736arXiv1506.07196OpenAlexW1715633553MaRDI QIDQ2976756FDOQ2976756
Authors: Itzhak Tamo, Alexander Barg, Alexey Frolov 
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1506.07196
Cited In (25)
- Codes for Distributed Storage
- Locally recoverable codes from towers of function fields
- A characterization of optimal locally repairable codes
- Locally repairable codes with multiple repair sets based on packings of block size 4
- Local asymptotic coding and the minimum description length
- RS-like locally recoverable codes with intersecting recovering sets
- New upper bounds and constructions of multi-erasure locally recoverable codes
- Title not available (Why is that?)
- Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Lifted Multiplicity Codes and the Disjoint Repair Group Property
- Limits on the Rate of Locally Testable Affine-Invariant Codes
- Optimal RS-like LRC codes of arbitrary length
- On finding the largest minimum distance of locally recoverable codes: a graph theory approach
- Locally repairable codes with high availability based on generalised quadrangles
- Some new constructions of optimal and almost optimal locally repairable codes
- A Family of Optimal Locally Recoverable Codes
- Locality via partially lifted codes
- A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
- On Singleton-type bound of locally repairable codes
- Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves
- Integrated interleaved codes as locally recoverable codes: properties and performance
- Locally recoverable \(J\)-affine variety codes
- Limitation on the Rate of Families of Locally Testable Codes
- Automata, Languages and Programming
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)
