Two classes of locally recoverable codes from cyclic codes with low locality
From MaRDI portal
Cites work
- A Family of Optimal Locally Recoverable Codes
- Bounds on the size of locally recoverable codes
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Constacyclic locally recoverable codes from their duals
- Constructions of Locally Recoverable Codes Which are Optimal
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Cyclic (r, ) locally recoverable codes from their constacyclic and negacyclic subcodes
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes
- Fundamentals of Error-Correcting Codes
- How Long Can Optimal Locally Repairable Codes Be?
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
- New Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes From Their Zeros
- New lower bounds for the minimum distance of cyclic codes and applications to locally repairable codes
- On the Locality of Codeword Symbols
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Optimal Locally Repairable Codes Via Elliptic Curves
- Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
This page was built for publication: Two classes of locally recoverable codes from cyclic codes with low locality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390349)
