Locally Recoverable codes with local error detection

2018/12/03 by Munuera, Carlos
#11G20 #11T71 #14G50 #94B05 #94B27 #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1812.00834

Abstract

A locally recoverable code is an error-correcting code such that any erasure in a coordinate of a codeword can be recovered from a set of other few coordinates. In this article we introduce a model of local recoverable codes that also includes local error detection. The cases of the Reed-Solomon and Locally Recoverable Reed-Solomon codes are treated in some detail.

Related

• Computing sharp recovery structures for Locally Recoverable codes
• A family of codes with variable locality and availability
• Locally Recoverable codes from rational maps
• Capacity of Locally Recoverable Codes
• Explicit Maximally Recoverable Codes with Locality