A Family of Optimal Locally Recoverable Codes
Work
Year: 2014
Type: article
Abstract: A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the encoding is a function of a small number (at most $r$) other symbols. We present a family of LRC codes that att... more
Authors Itzhak Tamo, Alexander Barg
Institution University of Maryland, College Park
Cites: 36
Cited by: 463
Related to: 10
FWCI: 65.24
Citation percentile (by year/subfield): 97.79
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Quality education
Open Access status: green