A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Building on work of Barg, Tamo, and Vl\u{a}du\c{t}, we present several constructions of locally recoverable codes from algebraic curves and surfaces.
['Alexander Barg', 'Kathryn Haymaker', 'Everett W. Howe', 'Gretchen L. Matthews', 'Anthony Várilly-Alvarado']
Locally recoverable codes from algebraic curves and surfaces