Optimal Quaternary (r,delta)-Locally Repairable Codes Achieving the Singleton-type Bound

TL;DR

This paper classifies all optimal quaternary locally repairable codes that meet the Singleton-type bound, providing explicit constructions for each parameter set, enhancing practical distributed storage system reliability.

Contribution

It offers a complete classification and explicit constructions of optimal quaternary locally repairable codes achieving the Singleton-type bound.

Findings

All such codes are classified and characterized.

Explicit constructions are provided for each parameter set.

Codes operate over a finite field of size four, suitable for practical use.

Abstract

Locally repairable codes enables fast repair of node failure in a distributed storage system. The code symbols in a codeword are stored in different storage nodes, such that a disk failure can be recovered by accessing a small fraction of the storage nodes. The number of storage nodes that are contacted during the repair of a failed node is a parameter called locality. We consider locally repairable codes that can be locally recovered in the presence of multiple node failures. The punctured code obtained by removing the code symbols in the complement of a repair group is called a local code. We aim at designing a code such that all local codes have a prescribed minimum distance, so that any node failure can be repaired locally, provided that the total number of node failures is less than the tolerance parameter. We consider linear locally repairable codes defined over a finite field of size four. This alphabet has characteristic 2, and hence is amenable to practical implementation. We classify all quaternary locally repairable codes that attain the Singleton-type upper bound for minimum distance. For each combination of achievable code parameters, an explicit code construction is given.