Locally recoverable codes on surfaces

Cecília Salgado, Anthony Várilly-Alvarado, José Felipe Voloch

Research output: Contribution to journalArticleAcademic

3 Citations (Scopus)
152 Downloads (Pure)

Abstract

A linear error correcting code is a subspace of a finite dimensional space over a finite field with a fixed coordinate system. Such a code is said to be locally recoverable with locality $r$ if, for every coordinate, its value at a codeword can be deduced from the value of (certain) $r$ other coordinates of the codeword. These codes have found many recent applications, e.g., to distributed cloud storage. We will discuss the problem of constructing good locally recoverable codes and present some constructions using algebraic surfaces that improve previous constructions and sometimes provide codes that are optimal in a precise sense.
Original languageEnglish
Pages (from-to)5765-5777
Number of pages13
JournalIEEE Transactions on Information Theory
Volume67
Issue number9
DOIs
Publication statusPublished - Sept-2021
Externally publishedYes

Fingerprint

Dive into the research topics of 'Locally recoverable codes on surfaces'. Together they form a unique fingerprint.

Cite this