Locally Recoverable Codes correcting many erasures over small fields

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.