具有共同周期的二进制 m 序列的算术相关性

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications Pub Date : 2024-04-06 DOI:10.1016/j.ffa.2024.102424

Xiaoyan Jing , Keqin Feng

引用次数: 0

摘要

确定了周期为 2n1-1 和 2n2-1（gcd(n1,n2)=1）的二进制 m 序列的算术相关性。结果表明，此类二进制 m 序列算术相关性的绝对值不大于 2min(n1,n2)-1。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Arithmetic crosscorrelation of binary m-sequences with coprime periods

The arithmetic crosscorrelation of binary m-sequences with coprime periods $2^{n_{1}} - 1$ and $2^{n_{2}} - 1$ ( $\gcd (n_{1}, n_{2}) = 1$ ) is determined. The result shows that the absolute value of arithmetic crosscorrelation of such binary m-sequences is not greater than $2^{\min (n_{1}, n_{2})} - 1$ .

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Finite Fields and Their Applications 数学-数学

CiteScore

2.00

自引率

20.00%

发文量

133

审稿时长

6-12 weeks

期刊介绍： Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering. For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods. The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.