Back to Search
Start Over
Locally Recoverable Codes correcting many erasures over small fields.
- Source :
- Designs, Codes & Cryptography; Sep2021, Vol. 89 Issue 9, p2157-2162, 6p
- Publication Year :
- 2021
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- LINEAR codes
MAXIMA & minima
Subjects
Details
- Language :
- English
- ISSN :
- 09251022
- Volume :
- 89
- Issue :
- 9
- Database :
- Complementary Index
- Journal :
- Designs, Codes & Cryptography
- Publication Type :
- Academic Journal
- Accession number :
- 152014720
- Full Text :
- https://doi.org/10.1007/s10623-021-00905-4