| Autor: |
Galindo, C., Hernando, F., Martín-Cruz, H. |
| Zdroj: |
Designs, Codes & Cryptography; Sep2024, Vol. 92 Issue 9, p2549-2586, 38p |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink