Computing sharp recovery structures for Locally Recoverable codes

07/11/2019
by   Irene Marquez-Corbella, et al.
0

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 C and a recovery method that realizes it. This algorithm also provides the locality and the dual distance of C. Complexity issues are studied as well. Several examples are included.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset