On the Combinatorics of Locally Repairable Codes via Matroid Theory

TL;DR

This paper establishes a connection between matroid theory and locally repairable codes (LRCs), deriving new bounds, nonexistence results, and constructions for both linear and almost affine LRCs.

Contribution

It introduces a matroid-based framework for analyzing LRCs, generalizes parameters, and provides new bounds, constructions, and nonexistence results for these codes.

Findings

Matroid analogue of the generalized Singleton bound for LRCs.

Nonexistence of perfect almost affine LRCs for certain parameters.

New constructions of LRCs using matroid theory.

Abstract

This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters $(n,k,d,r,\delta)$ of LRCs are generalized to matroids, and the matroid analogue of the generalized Singleton bound in [P. Gopalan et al., "On the locality of codeword symbols," IEEE Trans. Inf. Theory] for linear LRCs is given for matroids. It is shown that the given bound is not tight for certain classes of parameters, implying a nonexistence result for the corresponding locally repairable almost affine codes, that are coined perfect in this paper. Constructions of classes of matroids with a large span of the parameters $(n,k,d,r,\delta)$ and the corresponding local repair sets are given. Using these matroid constructions, new LRCs are constructed with prescribed parameters. The existence results on linear LRCs and the nonexistence results on almost affine LRCs given in this paper strengthen the nonexistence and existence results on perfect linear LRCs given in [W. Song et al., "Optimal locally repairable codes," IEEE J. Sel. Areas Comm.].