On finding the largest minimum distance of locally recoverable codes: a graph theory approach
From MaRDI portal
Publication:6646417
DOI10.1016/j.disc.2024.114298MaRDI QIDQ6646417
Majid Khabbazian, Muriel Médard
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some simplified NP-complete graph problems
- Parallel concepts in graph theory
- Compactness results in extremal graph theory
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- On the Combinatorics of Locally Repairable Codes via Matroid Theory
- Locality and Availability in Distributed Storage
- Bounds on the Parameters of Locally Recoverable Codes
- Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes
- Bounds on the Size of Locally Recoverable Codes
- An Integer Programming-Based Bound for Locally Repairable Codes
- Repair Locality With Multiple Erasure Tolerance
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- The NP-Completeness of Edge-Coloring
- Optimal Locally Repairable Codes Via Elliptic Curves
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
This page was built for publication: On finding the largest minimum distance of locally recoverable codes: a graph theory approach
