Computing sharp recovery structures for Locally Recoverable codes
Information Theory
2019-07-12 v1 math.IT
Abstract
A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that computes a recovery structure as concise posible for an arbitrary linear code and a recovery method that realizes it. This algorithm also provides the locality and the dual distance of . Complexity issues are studied as well. Several examples are included.
Cite
@article{arxiv.1907.05316,
title = {Computing sharp recovery structures for Locally Recoverable codes},
author = {Irene Marquez-Corbella and Edgar Martinez-Moro and Carlos Munuera},
journal= {arXiv preprint arXiv:1907.05316},
year = {2019}
}
Comments
Submitted