arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.02047cs.DMmath.COmath.NT
收藏

大域上多项式的偏差与结构及其在信息论中的应用

Bias vs structure of polynomials in large fields, and applications in information theory

Abhishek Bhowmick, Shachar Lovett

摘要:

设$f$是有限域$\mathbb{F}$上以$n$为变量的次数为$d$的多项式.如果均匀输入$x \in \mathbb{F}^n$的$f(x)$的分布接近于$\mathbb{F}$上的均匀分布,则称多项式是无偏的,否则称为有偏的。如果多项式可以表示为几个低次多项式的合成,则称该多项式具有低秩。Green和Tao [Contrib. Discrete Math 2009]以及Kaufman和Lovett [FOCS 2008]表明,偏差意味着固定素数域上固定次数多项式的低秩。这是高阶傅立叶分析中许多工具的核心。在这项工作中,我们将这一结果推广到所有的素域(大小可能与$n$增长)。我们还提供了一个推广到非素领域的大特征的情况下。然而,为了简单起见,我们陈述了在素场设置中的所有应用。利用上述推广到大域作为出发点,我们也能够解决固定度Reed-Muller码在增长域上的列表解码半径。Bhowmick和Lovett [STOC 2015]解决了固定大小字段的情况,解决了Gopalan-Klivans-Zuckerman [STOC 2008]的猜想。在这里,我们表明,列表解码半径是等于所有固定度的代码的最小距离,即使字段大小可能与$n$增长。此外,我们有效地解决了固定度的Reed-Muller码在所有领域的重量分布问题,该问题首先在1977年由MacWilliams和Sloane在经典教科书[纠错码理论中的研究问题15.1]中提出。

英文摘要:

Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$. The polynomial is said to be unbiased if the distribution of $f(x)$ for a uniform input $x \in \mathbb{F}^n$ is close to the uniform distribution over $\mathbb{F}$, and is called biased otherwise. The polynomial is said to have low rank if it can be expressed as a composition of a few lower degree polynomials. Green and Tao [Contrib. Discrete Math 2009] and Kaufman and Lovett [FOCS 2008] showed that bias implies low rank for fixed degree polynomials over fixed prime fields. This lies at the heart of many tools in higher order Fourier analysis. In this work, we extend this result to all prime fields (of size possibly growing with $n$). We also provide a generalization to nonprime fields in the large characteristic case. However, we state all our applications in the prime field setting for the sake of simplicity of presentation. Using the above generalization to large fields as a starting point, we are also able to settle the list decoding radius of fixed degree Reed-Muller codes over growing fields. The case of fixed size fields was solved by Bhowmick and Lovett [STOC 2015], which resolved a conjecture of Gopalan-Klivans-Zuckerman [STOC 2008]. Here, we show that the list decoding radius is equal the minimum distance of the code for all fixed degrees, even when the field size is possibly growing with $n$. Additionally, we effectively resolve the weight distribution problem for Reed-Muller codes of fixed degree over all fields, first raised in 1977 in the classic textbook by MacWilliams and Sloane [Research Problem 15.1 in Theory of Error Correcting Codes].

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

↑