Optimal Locally Repairable Codes: An Improved Bound and Constructions
From MaRDI portal
Publication:5096971
Abstract: We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. We then also provide explicit constructions of optimal codes that show that for certain parameters the new bound is sharp. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal.
Cited in
(11)- The minimum locality of linear codes
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- On Optimal Locally Repairable Codes With Super-Linear Length
- A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes
- scientific article; zbMATH DE number 7378653 (Why is no real title available?)
- Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
- A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
- Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures
- On Singleton-type bound of locally repairable codes
- Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair
- An Outer Bound on the Storage-Bandwidth Tradeoff of Exact-Repair Cooperative Regenerating Codes
This page was built for publication: Optimal Locally Repairable Codes: An Improved Bound and Constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096971)