Perfect LRCs and \(k\)-optimal LRCs
From MaRDI portal
Publication:2697472
DOI10.1007/s10623-022-01148-7OpenAlexW4308965115MaRDI QIDQ2697472
Weijun Fang, Bin Chen, Xiangyu Chen, Fang-Wei Fu, Shutaong Xia
Publication date: 12 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01148-7
finite geometrydifference setslocally repairable codes\(q\)-Steiner systems\(k\)-optimal LRCsperfect LRCs
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Galois geometries and coding theory
- Linear programming bounds for distributed storage codes
- Equidistant codes in the Grassmannian
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Binary Linear Locally Repairable Codes
- Bounds on the Size of Locally Recoverable Codes
- An Integer Programming-Based Bound for Locally Repairable Codes
- On the Locality of Codeword Symbols
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes
- On Optimal Locally Repairable Codes With Super-Linear Length
- Constructions of Optimal Codes With Hierarchical Locality
- 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
- Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
- How Long Can Optimal Locally Repairable Codes Be?
- Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach
- Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- On the Nonexistence of Perfect Codes over Finite Fields
This page was built for publication: Perfect LRCs and \(k\)-optimal LRCs
