Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes

Locally repairable codes have become a key instrument in large-scale distributed storage systems. This paper focuses on the construction of locally repairable codes with
$(r,\delta)$
-locality that achieve equality in the Singleton-type bound. We use matrix-product codes to propose two constructions of
$q$
-ary optimal
$(r,\delta)$
locally repairable codes of lengths up to
$q^{2}+q$
. The ingredients in the matrix-product codes are linear maximum distance separable codes. We give another construction of optimal
$(r,\delta)$
locally repairable codes by using optimal locally repairable codes as ingredients in the matrix-product approach. The codes in this third construction have unbounded lengths not divisible by
$(r+\delta -1)$
. The three constructions of optimal
$(r,\delta)$
locally repairable codes constructed here are new. Previously constructed codes in the literature have not covered the same sets of parameters. Our construction proposals are flexible since one can easily vary
$r$
and
$\delta $
to come up with particular parameters that can suit numerous scenarios.