arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.15443cs.ITmath.IT
收藏

用函数域方法求最优LRC码的好多项式

A Function Field Approach Toward Good Polynomials for Further Results on Optimal LRC Codes

Ruikai Chen, Sihem Mesnager

摘要:

由于最近在分布式存储系统中的应用,研究人员引入了一类新的分组码,即,本地可恢复(LRC)代码LRC码可以通过访问少量的无擦除码符号来恢复擦除信息,并提高大规模分布式存储系统中修复过程的效率。在这种情况下,Tamo和Barg首先通过巧妙地引入一个好的多项式概念而取得了突破。构造良好的多项式的局部可恢复的代码实现Singleton型界(称为最优码)是具有挑战性的,近年来引起了极大的关注。这篇文章的目的是增加我们的知识,良好的多项式的最佳LRC码。使用代数函数场和伽罗瓦理论的工具,我们继续研究这些多项式,并通过开发Micheli在2019年发起的伽罗瓦理论方法来研究它们。具体来说,我们进一步推动了一个关键参数$\mathcal G(f)$(一个给定的多项式$f$),它的措施有多少多项式是“好”的LRC码的意义上的研究。给出了具有极小伽罗瓦群的多项式的一些特征,并证明了存在具有特定规模伽罗瓦群的多项式的有限域的一些性质。我们还提出了一些明确的形状多项式与小伽罗瓦群。对于某些特殊的多项式$f$,我们给出了$\mathcal G(f)$的精确公式.

英文摘要:

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 $\mathcal G(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 $\mathcal G(f)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑