Optimal binary and ternary locally repairable codes with minimum distance 6
From MaRDI portal
Publication:6499100
DOI10.1007/S10623-023-01341-2MaRDI QIDQ6499100FDOQ6499100
Authors: Wenqin Zhang, Yuan Luo, Lele Wang 
Publication date: 8 May 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Recommendations
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)
Cites Work
- On the Locality of Codeword Symbols
- Locally Repairable Codes
- A Family of Optimal Locally Recoverable Codes
- Partitions of a vector space
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- How Long Can Optimal Locally Repairable Codes Be?
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- Anticode-based locally repairable codes with high availability
- Bounds on the size of locally recoverable codes
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Optimal binary linear locally repairable codes with disjoint repair groups
- Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach
Cited In (3)
This page was built for publication: Optimal binary and ternary locally repairable codes with minimum distance 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499100)
