Papers › Bounds and Constructions for Linear Locally Repairable Codes over Binary Fields
Bounds and Constructions for Linear Locally Repairable Codes over Binary Fields
Anyu Wang, Zhifang Zhang, Dongdai Lin
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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≥5. A specific comparison shows this explicit bound outperforms the Cadambe-Mazumdar bound for 5≤d≤8 and large values of n. Moreover, a construction of binary linear LRCs with d≥6 attaining our second bound is provided.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections