Optimal (r,δ)-LRCs from monomial-Cartesian codes and their subfield-subcodes
comunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/173364
comunitat-uji-handle3:10234/173369
comunitat-uji-handle4:
INVESTIGACIONMetadatos
Título
Optimal (r,δ)-LRCs from monomial-Cartesian codes and their subfield-subcodesFecha de publicación
2024-05-02Editor
SpringerCita bibliográfica
Galindo, C., Hernando, F. & Martín-Cruz, H. Optimal -LRCs from monomial-Cartesian codes and their subfield-subcodes. Des. Codes Cryptogr. 92, 2549–2586 (2024). https://doi.org/10.1007/s10623-024-01403-zTipo de documento
info:eu-repo/semantics/articleVersión
info:eu-repo/semantics/publishedVersionPalabras clave / Materias
Resumen
We study monomial-Cartesian codes (MCCs) which can be regarded as (r,δ)-locally recoverable codes (LRCs). These codes come with a natural bound for their minimum distance and we determine those giving rise to (r,δ)- ... [+]
We study monomial-Cartesian codes (MCCs) which can be regarded as (r,δ)-locally recoverable codes (LRCs). These codes come with a natural bound for their minimum distance and we determine those giving rise to (r,δ)-optimal LRCs for that distance, which are in fact (r,δ)-optimal. A large subfamily of MCCs admits subfield-subcodes with the same parameters of certain optimal MCCs but over smaller supporting fields. This fact allows us to determine infinitely many sets of new (r,δ)-optimal LRCs and their parameters. [-]
Entidad financiadora
CRUE-CSIC agreement with Springer Nature
Título del proyecto o subvención
Open Access funding
Derechos de acceso
© The Author(s) 2024
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Aparece en las colecciones
- MAT_Articles [770]
- IMAC_Articles [122]