arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1812.06140math.NTcs.CR
收藏

勒让德序列族复杂度的改进下界

Improved lower bound on the family complexity of Legendre sequences

Yaǧmur Çakıroǧlu, Oǧuz Yayla

摘要:

本文研究了一类二元Legendre序列及其族的复杂性。家族复杂度是Ahlswede等人提出的一种伪随机性度量。al.~ 2003年Gyarmati在2015年给出了基于有限域上多项式的Legendre符号的族的族复杂度的下界。本文改进了Gyarmati关于二元Legendre序列族复杂度的界。该界依赖于Lambert W函数和属于其固有子域的有限域中的元素的数目。此外,我们提出了一个快速的方法来计算的界限。

英文摘要:

In this paper we study a family of binary Legendre sequences and its family complexity. Family complexity is a pseudorandomness measure introduced by Ahlswede et.~al.~in 2003. A lower bound on the family complexity of a family based on the Legendre symbol of polynomials over a finite field was given by Gyarmati in 2015. In this article we improve the bound given by Gyarmati on family complexity of binary Legendre sequences. The bound depends on the Lambert W function and the number of elements in a finite field belonging to its proper subfield. Moreover, we present a fast method for calculating the bound.

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

↑