A function field approach toward good polynomials for further results on optimal LRC codes

DOI10.1016/J.FFA.2022.102028MaRDI QIDQ2135563zbMATH OpenOpenAlexFDO

Authors Ruikai Chen, Sihem Mesnager

Publication date 9 May 2022

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.15443

zbMATH Keywords

algebraic function fieldscoding theoryDickson polynomialsfinite fieldsGalois groupsgood polynomialsLRC (locally recoverable) codes

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Polynomials over finite fields (11T06) Linear codes (general theory) (94B05)

Abstract: Because of the recent applications to distributed storage systems, researchers have introduced a new class of block codes, i.e., locally recoverable (LRC) codes. LRC codes can recover information from erasure(s) by accessing a small number of erasure-free code symbols and increasing the efficiency of repair processes in large-scale distributed storage systems. In this context, Tamo and Barg first gave a breakthrough by cleverly introducing a good polynomial notion. Constructing good polynomials for locally recoverable codes achieving Singleton-type bound (called optimal codes) is challenging and has attracted significant attention in recent years. This article aims to increase our knowledge of good polynomials for optimal LRC codes. Using tools from algebraic function fields and Galois theory, we continue investigating those polynomials and studying them by developing the Galois theoretical approach initiated by Micheli in 2019. Specifically, we push further the study of a crucial parameter $mathcalG(f)$ (of a given polynomial $f$), which measures how much a polynomial is "good" in the sense of LRC codes. We provide some characterizations of polynomials with minimal Galois groups and prove some properties of finite fields where polynomials exist with a specific size of Galois groups. We also present some explicit shapes of polynomials with small Galois groups. For some particular polynomials $f$, we give the exact formula of $mathcalG(f)$.

Recommendations

• On good polynomials over finite fields for optimal locally recoverable codes
• Good polynomials for optimal LRC of low locality
• Constructions of optimal locally recoverable codes via Dickson polynomials
• A characterization of optimal locally repairable codes
• Optimal selection for good polynomials of degree up to five

Cites work

• A Family of Optimal Locally Recoverable Codes
• Algebraic Function Fields and Codes
• Constructions of Locally Recoverable Codes Which are Optimal
• Constructions of optimal locally recoverable codes via Dickson polynomials
• Good polynomials for optimal LRC of low locality
• scientific article; zbMATH DE number 732318 (Why is no real title available?)
• scientific article; zbMATH DE number 953211 (Why is no real title available?)
• New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
• The distribution of polynomials over finite fields

Cited in

(9)

• Good polynomials for optimal LRC of low locality
• Constructions of optimal locally recoverable codes via Dickson polynomials
• On good polynomials over finite fields for optimal locally recoverable codes
• Optimal selection for good polynomials of degree up to five
• Constructions of maximally recoverable local reconstruction codes via function fields
• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
• Some new constructions of optimal and almost optimal locally repairable codes
• A new construction of maximally recoverable codes with hierarchical locality
• Optimal rank-metric codes with rank-locality from Drinfeld modules

This page was built for publication: A function field approach toward good polynomials for further results on optimal LRC codes

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