Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach

A locally repairable code (LRC) is a linear code such that every code symbol can be recovered by accessing a small number of other code symbols. In this paper, we study bounds and constructions of LRCs from the viewpoint of parity-check matrices. Firstly, a simple and unified framework based on pari...

Ausführliche Beschreibung