We define linear codes which are s-Locally Recoverable Codes (or s-LRC), i.e. codes which are LRC in s ways, the case s=1 roughly corresponding to the classical case of LRC codes. We use them to describe codes which correct many erasures, although they have small minimum distance. Any letter of a received word may be corrected using s different local codes. We use the Segre embedding of s local codes and then a linear projection.
Locally Recoverable Codes correcting many erasures over small fields / Ballico, Edoardo. - In: DESIGNS, CODES AND CRYPTOGRAPHY. - ISSN 0925-1022. - STAMPA. - 89:(2021), pp. 2157-2162. [10.1007/s10623-021-00905-4]
Locally Recoverable Codes correcting many erasures over small fields
Ballico, Edoardo
2021-01-01
Abstract
We define linear codes which are s-Locally Recoverable Codes (or s-LRC), i.e. codes which are LRC in s ways, the case s=1 roughly corresponding to the classical case of LRC codes. We use them to describe codes which correct many erasures, although they have small minimum distance. Any letter of a received word may be corrected using s different local codes. We use the Segre embedding of s local codes and then a linear projection.File | Dimensione | Formato | |
---|---|---|---|
Ballico2021_Article_LocallyRecoverableCodesCorrect (1).pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Creative commons
Dimensione
222.02 kB
Formato
Adobe PDF
|
222.02 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione