Mathematical LoRE: Local Recovery of Erasures using Polynomials, Curves, Surfaces, and Liftings
arXiv:2312.16314 · doi:10.1109/MBITS.2024.3359988
Abstract
Employing underlying geometric and algebraic structures allows for constructing bespoke codes for local recovery of erasures. We survey techniques for enriching classical codes with additional machinery, such as using lines or curves in projective space for local recovery sets or products of curves to enhance the availability of data.
arXiv commentIEEE BITS the Information Theory Magazine, to appear
References in corpus (6)
- A family of optimal locally recoverable codes
- Repair Locality with Multiple Erasure Tolerance
- Locally recoverable codes from algebraic curves and surfaces
- Constructions of Locally Recoverable Codes which are Optimal
- How to Construct Curves over Finite Fields With Many Points
- Locally recoverable codes on algebraic curves