Arithmetic crosscorrelation of binary $m$-sequences with coprime periods
Xiaoyan Jing, Keqin Feng

TL;DR
This paper determines the bounds of the arithmetic crosscorrelation between binary m-sequences with coprime periods, showing it does not exceed a specific exponential function of the smaller period.
Contribution
It provides a precise calculation of the arithmetic crosscorrelation for binary m-sequences with coprime periods, a previously unresolved problem.
Findings
The absolute value of the crosscorrelation is at most 2^{min(n1,n2)} - 1.
The result applies to sequences with coprime periods of the form 2^{n}-1.
The bounds improve understanding of sequence correlation properties in cryptography.
Abstract
The arithmetic crosscorrelation of binary -sequences with coprime periods and \ () is determined. The result shows that the absolute value of arithmetic crosscorrelation of such binary -sequences is not greater than .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Mathematical Approximation and Integration · Mathematical Dynamics and Fractals
