Locally Recoverable Codes correcting many erasures over small fields
Edoardo Ballico · Designs Codes and Cryptography · 2021
Abstract We define linear codes which ares-Locally Recoverable Codes (ors-LRC), i.e. codes which are LRC insways, 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 usingsdifferent local codes. We use the Segre embedding ofslocal codes and then a linear projection.