Locally recoverable J-affine variety codes
comunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/173364
comunitat-uji-handle3:10234/173369
comunitat-uji-handle4:
INVESTIGACIONMetadatos
Título
Locally recoverable J-affine variety codesFecha de publicación
2020-06Cita bibliográfica
GALINDO PASTOR, Carlos; HERNANDO, Fernando; MUNUERA, Carlos (2020). Locally recoverable J-affine variety codes. Finite Fields and Their Applications, v. 64Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
https://www.sciencedirect.com/science/article/pii/S1071579720300307Versión
info:eu-repo/semantics/acceptedVersionPalabras clave / Materias
Resumen
A locally recoverable (LRC) code is a code over a finite eld Fq such that
any erased coordinate of a codeword can be recovered from a small number of other
coordinates in that codeword. We construct LRC codes ... [+]
A locally recoverable (LRC) code is a code over a finite eld Fq such that
any erased coordinate of a codeword can be recovered from a small number of other
coordinates in that codeword. We construct LRC codes correcting more than one erasure,
which are sub eld-subcodes of some J-affine variety codes. For these LRC codes, we
compute localities (r; )) that determine the minimum size of a set R of positions so that
any - 1 erasures in R can be recovered from the remaining r coordinates in this set.
We also show that some of these LRC codes with lengths n >> q are ( - 1)-optimal. [-]
Publicado en
Finite Fields and Their Applications (2020), v. 64Proyecto de investigación
1) Spanish Goverment, Ministerio de Ciencia, Innovación y Universidades (MICINN)/FEDER (grants PGC2018-096446-B-C21 and PGC2018-096446-B-C22); 2) Generalitat Valenciana (grant AICO-2019-223) and 3) University Jaume I (grant PB1-1B2018-10).Derechos de acceso
http://rightsstatements.org/vocab/CNE/1.0/
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Aparece en las colecciones
- IMAC_Articles [122]