2000 character limit reached
Locally recoverable codes from algebraic curves and surfaces
Published 18 Jan 2017 in cs.IT, math.AG, and math.IT | (1701.05212v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.