Abstract
AbstractWe 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$$
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.
Funder
Università degli Studi di Trento
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference21 articles.
1. Ballico, E., Marcolla, C.: Higher Hamming weights for locally recoverable algebraic curves. Finite Fields Its Appl. 40, 61–72 (2016)
2. Barg, A., Haymaker, K., Howe, E., Everett, W., Matthews, G.L., Várilly-Alvarado, A.: Locally recoverable codes from algebraic curves and surfaces. In: Howe, E.W., Lauter, K., Walker, J. (eds.) Algebraic Geometry for Coding Theory and Cryptography. Association for Women in Mathematics Series, vol. 9, pp. 95–127. Springer, Cham (2017)
3. Barg, A., Tamo, I., Vlădut, S.: Locally recoverable codes on algebraic curves. IEEE Trans. Inform. Theory 63(8), 4928–4939 (2017)
4. Beutelspacher, A.: Blocking sets and partal spreads in finite projective spaces. Geom. Dedicata 9, 425–449 (1980)
5. Bogart, T., Horlemann-Trautmann, A.L., Karpuk, D., Neri, A., Velasco, M.: Constructing partial MDS codes from reducible algebraic curves, arXiv:2007.14829.