Locally Recoverable Codes correcting many erasures over small fields
Keyword(s):
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.
1987 ◽
Vol 33
(5)
◽
pp. 665-680
◽
2011 ◽
Vol 57
(9)
◽
pp. 6089-6093
◽
Keyword(s):
1973 ◽
Vol 19
(3)
◽
pp. 344-356
◽