Details

Autor(en) / Beteiligte

• Hao, Jie
• Xia, Shu-Tao
• Shum, Kenneth W.
• Chen, Bin
• Fu, Fang-Wei
• Yang, Yixian

Titel

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

Ist Teil von

• IEEE transactions on information theory, 2020-12, Vol.66 (12), p.7465-7474

Ort / Verlag

New York: IEEE

Erscheinungsjahr

2020

Quelle

IEEE Xplore Digital Library

Beschreibungen/Notizen

• 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 parity-check matrix to analyze the bounds of LRCs is proposed, and several new explicit bounds on the minimum distance of LRCs in terms of the field size are presented. In particular, we give an alternate proof of the Singleton-like bound for LRCs first proved by Gopalan et al. Some structural properties on optimal LRCs that achieve the Singleton-like bound are given. Then, we focus on constructions of optimal LRCs over the binary field. It is proved that there are only five classes of possible parameters with which optimal binary LRCs exist. Moreover, by employing the proposed parity-check matrix approach, we completely enumerate all these five classes of optimal binary LRCs attaining the Singleton-like bound in the sense of equivalence of linear codes.