ListarIMAC_Articles por tema "locally recoverable codes"
Mostrando ítems 1-1 de 1
-
Optimal (r,δ)-LRCs from monomial-Cartesian codes and their subfield-subcodes
Springer (2024-05-02)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 ...
