Locally Repairable Codes
From MaRDI portal
Abstract: Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of off-the-shelf erasure codes is their high-repair cost during single node failure events. A major open problem in this area has been the design of codes that {it i)} are repair efficient and {it ii)} achieve arbitrarily high data rates. In this paper, we explore the repair metric of {it locality}, which corresponds to the number of disk accesses required during a {color{black}single} node repair. Under this metric we characterize an information theoretic trade-off that binds together locality, code distance, and the storage capacity of each node. We show the existence of optimal {it locally repairable codes} (LRCs) that achieve this trade-off. The achievability proof uses a locality aware flow-graph gadget which leads to a randomized code construction. Finally, we present an optimal and explicit LRC that achieves arbitrarily high data-rates. Our locality optimal construction is based on simple combinations of Reed-Solomon blocks.
Cited in
(42)- Codes that detect localized errors.
- Anticode-based locally repairable codes with high availability
- Architecture-aware coding for distributed storage: repairable block failure resilient codes
- Locally recoverable codes correcting many erasures over small fields
- RS-like locally recoverable codes with intersecting recovering sets
- 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
- Optimal cyclic locally repairable codes with unbounded length from their zeros
- Linear programming bounds for distributed storage codes
- Two classes of optimal LRCs with information (r, t)-locality
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- Self-repairing codes
- On binary locally repairable codes with distance four
- Optimal selection for good polynomials of degree up to five
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
- Higher Hamming weights for locally recoverable codes on algebraic curves
- Codes Between MBR and MSR Points With Exact Repair Property
- scientific article; zbMATH DE number 7378653 (Why is no real title available?)
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- Constructions of maximally recoverable local reconstruction codes via function fields
- Codes for Distributed Storage
- Codes in the sum-rank metric: fundamentals and applications
- Optimal binary and ternary locally repairable codes with minimum distance 6
- On Singleton-type bound of locally repairable codes
- Extension-based constructions of locally repairable fractional repetition codes
- Optimal ternary locally repairable codes
- Locally maximal recoverable codes and LMR-LCD codes
- On information-theoretic secure multiparty computation with local repairability
- Some new constructions of optimal and almost optimal locally repairable codes
- Easy repair via codes with simplex locality
- Locally recoverable algebro-geometric codes from projective bundles
- An algorithm for computing generalized Hamming weights and the Sage package \texttt{GHWs}
- 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
- A family of self-orthogonal divisible codes with locality 2
- Two families of optimal quantum locally recoverable codes
- Explicit constructions of optimal vector locally repairable codes
- Locally maximal recoverable codes with unequal localities and LMR codes with hierarchical locality
- Optimal quantum (r, )-locally repairable codes via classical ones
- Optimal RS-like LRC codes of arbitrary length
- Computing sharp recovery structures for locally recoverable codes
This page was built for publication: Locally Repairable Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983383)
