Locally recoverable \(J\)-affine variety codes (Q1987102): Difference between revisions

A locally recoverable (LRC) code is a code over a finite field \(\mathbb{F}_q\) such that any erased coordinate of a codeword can be recovered from a small number of other coordinates in that codeword. As an answer to multiple device failures case the concept of localities \((r, \delta)\) of an LRC code is considered. It means the minimum size of a set \(\overline{R}\) of positions so that any \(\delta-1\) erasures in \(\overline{R}\) can be recovered from the remaining \(r\) coordinates in this set to be determined. The authors construct LRC codes, which are subfield-subcodes of some \(J\)-affine variety codes and compute their localities \((r, \delta)\). They also show that some of the constructed LRC codes have lengths \(n \gg q\) and are \((\delta-1)\)-optimal.