paper

Locally recoverable codes from algebraic curves and surfaces

arXiv:1701.05212 · doi:10.1007/978-3-319-63931-4_4

Abstract

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ăduţ, we present several constructions of locally recoverable codes from algebraic curves and surfaces.

27 pages