Good polynomials for optimal LRC of low locality
From MaRDI portal
Publication:2035459
DOI10.1007/s10623-021-00886-4zbMath1469.94127OpenAlexW3164555804MaRDI QIDQ2035459
Chang-An Zhao, Ruikai Chen, Sihem Mesnager
Publication date: 24 June 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00886-4
Related Items (3)
A function field approach toward good polynomials for further results on optimal LRC codes ⋮ Optimal selection for good polynomials of degree up to five ⋮ New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
Cites Work
- On the size of Kakeya sets in finite vector spaces
- Note on cubics over \(GF(2^n)\) and \(GF(3^n)\)
- Intersection distribution, non-hitting index and Kakeya sets in affine planes
- Constructions of optimal locally recoverable codes via Dickson polynomials
- On factoring quartics \(\pmod p)\)
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- Codes from Difference Sets
- New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Constructions of Locally Recoverable Codes Which are Optimal
This page was built for publication: Good polynomials for optimal LRC of low locality