A Function Field Approach Toward Good Polynomials for Further Results on Optimal LRC Codes
Ruikai Chen, Sihem Mesnager

TL;DR
This paper explores the construction of good polynomials for optimal locally recoverable codes (LRCs) using algebraic function fields and Galois theory, advancing understanding of polynomial properties that enhance distributed storage systems.
Contribution
It develops a Galois-theoretic approach to characterize and analyze good polynomials for optimal LRC codes, extending previous methods and providing explicit polynomial examples.
Findings
Characterization of polynomials with minimal Galois groups
Properties of finite fields with specific Galois group sizes
Explicit formulas for the parameter $\
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
