Good polynomials for optimal LRC of low locality

DOI10.1007/S10623-021-00886-4MaRDI QIDQ2035459zbMATH OpenOpenAlexFDO

Authors Ruikai Chen, Sihem Mesnager, Chang-An Zhao

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

zbMATH Keywords

coding theorygood polynomiallocalityLRC codestorage

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Linear codes (general theory) (94B05)

Recommendations

• On good polynomials over finite fields for optimal locally recoverable codes
• New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
• A function field approach toward good polynomials for further results on optimal LRC codes
• Asymptotically optimal binary codes of polynomial complexity correcting localized errors
• Local decoding and testing of polynomials over grids
• Local decoding and testing of polynomials over grids
• Low order polynomial bounds on the expected performance of local improvement algorithms
• Constructions of optimal locally recoverable codes via Dickson polynomials

Cites work

• A Family of Optimal Locally Recoverable Codes
• Codes from difference sets
• Constructions of Locally Recoverable Codes Which are Optimal
• Constructions of optimal locally recoverable codes via Dickson polynomials
• Intersection distribution, non-hitting index and Kakeya sets in affine planes
• New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
• Note on cubics over GF(2ⁿ) and GF(3ⁿ)
• On factoring quartics \(\pmod p)\)
• On the Locality of Codeword Symbols
• On the size of Kakeya sets in finite vector spaces
• 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

Cited in

(10)

• A function field approach toward good polynomials for further results on optimal LRC codes
• Constructions of optimal locally recoverable codes via Dickson polynomials
• Optimal selection for good polynomials of degree up to five
• scientific article; zbMATH DE number 512812 (Why is no real title available?)
• Low order polynomial bounds on the expected performance of local improvement algorithms
• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
• Some new constructions of optimal and almost optimal locally repairable codes
• Good polynomials for locally recoverable codes: classification results, asymptotics, and exact formulae
• A new construction of maximally recoverable codes with hierarchical locality
• Intersection distribution of degree four polynomials over finite fields

This page was built for publication: Good polynomials for optimal LRC of low locality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035459)