有限域上的测不准原理
The uncertainty principle over finite fields
摘要:
本文研究了有限域上函数与其Mattson-Solomon多项式之间的测不准原理,它是一种具有正特征的傅里叶变换.结合循环码的渐近理论,研究了有限域上UP的三种形式。我们首先证明了没有有限域满足最近由Evra,Kowalsky,Lubotzky,2017引入的UP的强版本。通过使用渐进Plotkin界,给出了弱版本的改进。利用BCH界证明了复数上Donoho-Stark界在有限域上的直接模拟.它足够强,足以表明存在长度为$n$,任意速率和最小距离$Ω(n^α)$的循环码序列,对于所有$0<α<1/2$。最后指出了它与拉姆齐理论的联系。
英文摘要:
In this paper we study the uncertainty principle (UP) connecting a function over a finite field and its Mattson-Solomon polynomial, which is a kind of Fourier transform in positive characteristic. Three versions of the UP over finite fields are studied, in connection with the asymptotic theory of cyclic codes. We first show that no finite field satisfies the strong version of UP, introduced recently by Evra, Kowalsky, Lubotzky, 2017. A refinement of the weak version is given, by using the asymptotic Plotkin bound. A naive version, which is the direct analogue over finite fields of the Donoho-Stark bound over the complex numbers, is proved by using the BCH bound. It is strong enough to show that there exist sequences of cyclic codes of length $n$, arbitrary rate, and minimum distance $Ω(n^α)$ for all $0<α<1/2$. Finally, a connection with Ramsey Theory is pointed out.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。