Locally recoverable codes from algebraic curves and surfaces
Information Theory
2020-01-16 v1 Algebraic Geometry
math.IT
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\u{a}du\c{t}, we present several constructions of locally recoverable codes from algebraic curves and surfaces.
Keywords
Cite
@article{arxiv.1701.05212,
title = {Locally recoverable codes from algebraic curves and surfaces},
author = {Alexander Barg and Kathryn Haymaker and Everett W. Howe and Gretchen L. Matthews and Anthony Várilly-Alvarado},
journal= {arXiv preprint arXiv:1701.05212},
year = {2020}
}
Comments
27 pages