Live briefing
Everything about Locally recoverable code
Coding Theory
Locally recoverable codes are a family of error correction codes that were introduced first by D. S. Papailiopoulos and A. G. Dimakis and have been widely studied in information theory due to their applications related to distributive and cloud storage systems. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Locally recoverable codeA 5-minute orientation
- Skim a recent paper: Constructions of near MDS codes which are optimal locally recoverable codesInfluential work since 2022
- Pick up a classic book: Advances in Multimedia Information Processing – PCM 2012The most-reprinted book on the subject
- Read the landmark paper: A Family of Optimal Locally Recoverable CodesCited 500 times
- Go sideways: Locally decodable codeA closely related topic
- Go sideways: Folded Reed–Solomon codeA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A Family of Optimal Locally Recoverable Codes
Bounds on the Size of Locally Recoverable Codes
Bounds on the Parameters of Locally Recoverable Codes
Locally Recoverable Codes on Algebraic Curves
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
Practical Design Considerations for Wide Locally Recoverable Codes (LRCs)
Constructions of Locally Recoverable Codes Which are Optimal
🆕 Influential since 2022
Constructions of near MDS codes which are optimal locally recoverable codes
Bounds and Constructions of Quantum Locally Recoverable Codes From Quantum CSS Codes
Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory
A construction of optimal locally recoverable codes
Quantum Locally Recoverable Codes via Good Polynomials
đź“š Books worth reading
Advances in Multimedia Information Processing – PCM 2012Weisi Lin · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Locally decodable code A locally decodable code (LDC) is an error-correcting code that allows a single bit of the original message to be decoded with high probability by only…
- Folded Reed–Solomon code In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping m {\displaystyle m} Reed–Solomon codewords over…
- Hilbert's Theorem 90 In abstract algebra, Hilbert's Theorem 90 (or Satz 90) is an important result on cyclic extensions of fields (or to one of its generalizations) that leads…
- Factor theorem In algebra, the factor theorem connects polynomial factors with polynomial roots. Specifically, if f ( x ) {\displaystyle f(x)} is a (univariate) polynomial…
- Riemann–Roch theorem The Riemann–Roch theorem is an important theorem in mathematics, specifically in complex analysis and algebraic geometry, for the computation of the dimension…
- Grothendieck inequality In mathematics, the Grothendieck inequality states that there is a universal constant K G {\displaystyle K_{G}} with the following property. If Mij is…
- Bose–Mesner algebra In mathematics, a Bose–Mesner algebra is a special set of matrices which arise from a combinatorial structure known as an association scheme, together…
- Shamir's secret sharing Shamir's secret sharing (SSS) is an efficient secret sharing algorithm for distributing private information (the "secret") among a group, first developed…