A Connection Between Locally Repairable Codes and Exact Regenerating Codes

TL;DR

This paper establishes a novel connection between locally repairable codes and exact regenerating codes, interpreting LRCs as a special case of regenerating codes, and demonstrates that some LRCs outperform traditional time-sharing codes.

Contribution

It introduces a new relationship between LRCs and regenerating codes, providing a unified perspective and improving code performance.

Findings

Locally repairable codes can be viewed as exact regenerating codes.

Some LRCs outperform time-sharing codes between MSR and MBR.

The connection offers new insights into code design and performance.

Abstract

Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of each other, and it has not been clear how the parameters of one relate to those of the other. In this paper, a novel connection between locally repairable codes and exact regenerating codes is established. Via this connection, locally repairable codes are interpreted as exact regenerating codes. Further, some of these codes are shown to perform better than time-sharing codes between minimum bandwidth regenerating and minimum storage regenerating codes.