Locally Recoverable codes with local error detection
Information Theory
2018-12-04 v1 math.IT
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.
Cite
@article{arxiv.1812.00834,
title = {Locally Recoverable codes with local error detection},
author = {Carlos Munuera},
journal= {arXiv preprint arXiv:1812.00834},
year = {2018}
}