Bounds and Constructions for Linear Locally Repairable Codes over Binary Fields

Abstract

For binary $[n,k,d]$ linear locally repairable codes (LRCs), two new upper bounds on $k$ are derived. The first one applies to LRCs with disjoint local repair groups, for general values of $n,d$ and locality $r$, containing some previously known bounds as special cases. The second one is based on solving an optimization problem and applies to LRCs with arbitrary structure of local repair groups. Particularly, an explicit bound is derived from the second bound when $d\ge 5$. A specific comparison shows this explicit bound outperforms the Cadambe-Mazumdar bound for $5\le d\le 8$ and large values of $n$. Moreover, a construction of binary linear LRCs with $d\ge 6$ attaining our second bound is provided.

7 pages, 2 figures

References in corpus (7)

• A family of optimal locally recoverable codes
• Binary Cyclic Codes that are Locally Repairable
• Optimal Locally Repairable Codes via Rank-Metric Codes
• Optimal Locally Repairable Codes and Connections to Matroid Theory
• Codes with Locality for Two Erasures
• Bounds and Constructions of Locally Repairable Codes: Parity-check Matrix Approach
• Optimal Binary Locally Repairable Codes via Anticodes