Optimal binary and ternary locally repairable codes with minimum distance 6
From MaRDI portal
Publication:6499100
Recommendations
Cites work
- A Family of Optimal Locally Recoverable Codes
- Anticode-based locally repairable codes with high availability
- Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach
- Bounds on the size of locally recoverable codes
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- How Long Can Optimal Locally Repairable Codes Be?
- Locally Repairable Codes
- On the Locality of Codeword Symbols
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Optimal binary linear locally repairable codes with disjoint repair groups
- Partitions of a vector space
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
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)