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

提升Reed-Solomon码与提升多重码

Lifted Reed-Solomon Codes and Lifted Multiplicity Codes

Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev, Eitan Yaakobi

摘要:

提升Reed-Solomon码和多重性码是从$m$变量多项式的特定集合构造的码的类别。这些代码允许高速率代码的设计,可以从许多不相交的集合中恢复每个码字或信息符号。最近,基本的方法已经结合了双变量的情况下,构建提升多重性代码,提升代码的泛化,可以提供进一步的速率提高。我们继续这些代码的研究,首先建立新的下限上的任何数量的变量$m$,提高后的任何$m\ge 4$的已知界限的提升里德-所罗门码的速率。接下来,我们使用这些结果,以提供从多项式在任意数量的变量,提高后的任何$m\ge 3$的已知结果的提升多重性代码的速率和距离的下限。具体来说,我们调查的一个子码的解除多重性代码形成的线性跨度的$m$变量单项式的限制,在$\mathbb{F}_q^m$的任意线是相当于一个低次单变量多项式。当变量数$m$固定且字母表大小$q=2^\ell$较大时,我们发现了这种单项式的分数的紧渐近行为。利用这些结果,我们给出了一个新的显式构造的批码利用提升Reed-Solomon码。对于某些参数制度,这些代码有一个更好的权衡参数比以前已知的批处理代码。此外,我们发现,解除多重性代码有一个更好的权衡冗余和不相交的恢复集的数量为每个码字或信息符号比以前已知的建设,从而提供了最知名的PIR码的一些参数制度。此外,我们提出了一个新的局部自校正算法的提升多重码。

英文摘要:

Lifted Reed-Solomon and multiplicity codes are classes of codes, constructed from specific sets of $m$-variate polynomials. These codes allow for the design of high-rate codes that can recover every codeword or information symbol from many disjoint sets. Recently, the underlying approaches have been combined for the bi-variate case to construct lifted multiplicity codes, a generalization of lifted codes that can offer further rate improvements. We continue the study of these codes by first establishing new lower bounds on the rate of lifted Reed-Solomon codes for any number of variables $m$, which improve upon the known bounds for any $m\ge 4$. Next, we use these results to provide lower bounds on the rate and distance of lifted multiplicity codes obtained from polynomials in an arbitrary number of variables, which improve upon the known results for any $m\ge 3$. Specifically, we investigate a subcode of a lifted multiplicity code formed by the linear span of $m$-variate monomials whose restriction to an arbitrary line in $\mathbb{F}_q^m$ is equivalent to a low-degree univariate polynomial. We find the tight asymptotic behavior of the fraction of such monomials when the number of variables $m$ is fixed and the alphabet size $q=2^\ell$ is large. Using these results, we give a new explicit construction of batch codes utilizing lifted Reed-Solomon codes. For some parameter regimes, these codes have a better trade-off between parameters than previously known batch codes. Further, we show that lifted multiplicity codes have a better trade-off between redundancy and the number of disjoint recovering sets for every codeword or information symbol than previously known constructions, thereby providing the best known PIR codes for some parameter regimes. Additionally, we present a new local self-correction algorithm for lifted multiplicity codes.

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

↑