Good polynomials for optimal LRC of low locality
type: Item
instance of: scholarly article
title: Good polynomials for optimal LRC of low locality
zbMATH Open document ID: 1469.94127
author: Ruikai Chen
author: Sihem Mesnager
author: Chang-An Zhao
published in: Designs, Codes and Cryptography
publication date: 2021-06-24T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 11T06
zbMATH DE Number: 7363109
zbMATH Keywords: good polynomial
zbMATH Keywords: LRC code
zbMATH Keywords: locality
zbMATH Keywords: coding theory
zbMATH Keywords: storage
MaRDI profile type: Publication
full work available at URL: s10623-021-00886-4
OpenAlex ID: W3164555804
cites work: Codes from Difference Sets
cites work: On the Locality of Codeword Symbols
cites work: On the size of Kakeya sets in finite vector spaces
cites work: On factoring quartics \(\pmod p)\)
cites work: Intersection distribution, non-hitting index and Kakeya sets in affine planes
cites work: Optimal Locally Repairable Codes Via Elliptic Curves
cites work: New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
cites work: Constructions of optimal locally recoverable codes via Dickson polynomials
cites work: Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
cites work: Constructions of Locally Recoverable Codes Which are Optimal
cites work: A Family of Optimal Locally Recoverable Codes
cites work: Optimal Locally Repairable Codes and Connections to Matroid Theory
cites work: Note on cubics over \(GF(2^n)\) and \(GF(3^n)\)
DOI: 10.1007/S10623-021-00886-4
Recommended article: On good polynomials over finite fields for optimal locally recoverable codes
Recommended article: New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
Recommended article: A function field approach toward good polynomials for further results on optimal LRC codes
Recommended article: Asymptotically optimal binary codes of polynomial complexity correcting localized errors
Recommended article: Local decoding and testing of polynomials over grids
Recommended article: Q4993289
Recommended article: Low order polynomial bounds on the expected performance of local improvement algorithms
Recommended article: Constructions of optimal locally recoverable codes via Dickson polynomials
Recommended article: High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
description: scientific article; zbMATH DE number 7363109