Locally recoverable J-affine variety codes

11/18/2019

∙

by   Carlos Galindo, et al.

∙

0

∙

share

We prove that subfield-subcodes over finite fields F_q of some J-affine variety codes provide locally recoverable codes correcting more than one erasure. We compute their (r,δ)-localities and show that some of these codes with lengths n ≫ q are (δ -1)-optimal.