| Popis: |
Matrix-product constructions giving rise to locally recoverable codes are considered, both the classical $r$ and $(r,\delta)$ localities. We study the recovery advantages offered by the constituent codes and also by the defining matrices of the matrix product codes. Finally, we extend these methods to a particular variation of matrix-product codes and quasi-cyclic codes. Singleton-optimal locally recoverable codes and almost Singleton-optimal codes, with length larger than the finite field size, are obtained, some of them with superlinear length. |
