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

由Fermat行列式导出的二元序列的迹表示和线性复杂度

Trace representation and linear complexity of binary sequences derived from Fermat quotients

Zhixiong Chen

摘要:

通过确定陪集的所有二元特征序列的定义对,刻画了由Fermat商模奇素数$p$导出的两类二元序列(一类是二元阈值序列,另一类是Legendre-Fermat商序列)的迹表示,其中陪集的所有二元特征序列的定义对与Fermat商的每个固定值的模$p^2$的原像集一致.在$2^{p-1}\not\equiv 1 \bmod {p^2}$的假设下,由定义对得到了二元门限序列线性复杂度的一个较早的结果和Legendre-Fermat商序列线性复杂度的一个新结果.

英文摘要:

We describe the trace representations of two families of binary sequences derived from Fermat quotients modulo an odd prime $p$ (one is the binary threshold sequences, the other is the Legendre-Fermat quotient sequences) via determining the defining pairs of all binary characteristic sequences of cosets, which coincide with the sets of pre-images modulo $p^2$ of each fixed value of Fermat quotients. From the defining pairs, we can obtain an earlier result of linear complexity for the binary threshold sequences and a new result of linear complexity for the Legendre-Fermat quotient sequences under the assumption of $2^{p-1}\not\equiv 1 \bmod {p^2}$.

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

↑