Locally Recoverable codes with local error detection

12/03/2018
by   Carlos Munuera, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2019

Computing sharp recovery structures for Locally Recoverable codes

A locally recoverable code is an error-correcting code such that any era...
research
06/07/2018

Locally Recoverable codes from algebraic curves with separated variables

A Locally Recoverable code is an error-correcting code such that any era...
research
10/29/2019

Locally recoverable codes on surfaces

A linear error correcting code is a subspace of a finite dimensional spa...
research
08/29/2023

Lower Rate Bounds for Hermitian-Lifted Codes for Odd Prime Characteristic

Locally recoverable codes are error correcting codes with the additional...
research
08/29/2023

New Codes on High Dimensional Expanders

We describe a new parameterized family of symmetric error-correcting cod...
research
07/26/2019

Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes

A monomial-Cartesian code is an evaluation code defined by evaluating a ...
research
06/29/2023

Relaxed Local Correctability from Local Testing

We cement the intuitive connection between relaxed local correctability ...

Please sign up or login with your details

Forgot password? Click here to reset