Constacyclic locally recoverable codes from their duals
From MaRDI portal
Publication:6546491
DOI10.1007/s40314-024-02705-7MaRDI QIDQ6546491
Rabia Zengin, Mehmet E. Koroglu
Publication date: 29 May 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Cites Work
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- The Magma algebra system. I: The user language
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Bounds on the Size of Locally Recoverable Codes
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- Fundamentals of Error-Correcting Codes
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- New Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes From Their Zeros
- Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
- Constructions of Locally Recoverable Codes Which are Optimal
- How Long Can Optimal Locally Repairable Codes Be?
- 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
Related Items (1)
This page was built for publication: Constacyclic locally recoverable codes from their duals
