English
Related papers

Related papers: Arithmetic crosscorrelation of binary $m$-sequence…

200 papers

The (classical) crosscorrelation is an important measure of pseudorandomness of two binary sequences for applications in communications. The arithmetic crosscorrelation is another figure of merit introduced by Goresky and Klapper…

Cryptography and Security · Computer Science 2022-03-23 Zhixiong Chen , Zhihua Niu , Arne Winterhof

The determination of the cross correlation between an $m$-sequence and its decimated sequence has been a long-standing research problem. Considering a ternary $m$-sequence of period $3^{3r}-1$, we determine the cross correlation…

Information Theory · Computer Science 2013-10-01 Tao Zhang , Shuxing Li , Tao Feng , Gennian Ge

Binary $m$-sequences are ones with the largest period $n=2^m-1$ among the binary sequences produced by linear shift registers with length $m$. They have a wide range of applications in communication since they have several desirable…

Information Theory · Computer Science 2022-12-01 Xiaoyan Jing , Aixian Zhang , Keqin Feng

In this paper, we follow the recent work of Helleseth, Kholosha, Johanssen and Ness to study the cross correlation between an $m$-sequence of period $2^m-1$ and the $d$-decimation of an $m$-sequence of shorter period $2^{n}-1$ for an even…

Information Theory · Computer Science 2008-01-08 Lei Hu , Xiangyong Zeng , Nian Li , Wenfeng Jiang

Considered is the distribution of the crosscorrelation between $m$-sequences of length $2^m-1$, where $m=2k$, and $m$-sequences of shorter length $2^k-1$. New pairs of $m$-sequences with three-valued crosscorrelation are found and the…

Cryptography and Security · Computer Science 2007-05-23 Tor Helleseth , Alexander Kholosha , Geir Jarle Ness

Let $n=2m$, $m$ odd, $e|m$, and $p$ odd prime with $p\equiv1\ \mathrm{mod}\ 4$. Let $d=\frac{(p^{m}+1)^{2}}{2(p^{e}+1)}$. In this paper, we study the cross-correlation between a $p$-ary $m$-sequence $\{s_{t}\}$ of period $p^{2m}-1$ and its…

Information Theory · Computer Science 2011-11-16 Yuhua Sun , Hui Li , Zilong Wang

{\bf Abstract.} Considered is the distribution of the cross correlation between $m$-sequences of length $2^m-1$, where $m$ is even, and $m$-sequences of shorter length $2^{m/2}-1$. The infinite family of pairs of $m$-sequences with…

Discrete Mathematics · Computer Science 2007-12-24 Tor Helleseth , Alexander Kholosha , Aina Johanssen

It is shown that pairs of maximal linear recursive sequences (m-sequences) typically have mean square aperiodic crosscorrelation on par with that of random sequences, but that if one takes a pair of m-sequences where one is the reverse of…

Information Theory · Computer Science 2016-07-07 Daniel J. Katz

An $m$-sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balance, uniform pattern distribution and ideal autocorrelation…

Information Theory · Computer Science 2022-03-23 Zhixiong Chen , Zhihua Niu , Yuqi Sang , Chenhuang Wu

We prove a conjecture of Helleseth that claims that for any $n \geq 0$, a pair of binary maximal linear sequences of period $2^{2^n}-1$ can not have a three-valued cross-correlation function.

Combinatorics · Mathematics 2011-10-31 Daniel J. Katz

In this paper, new pairs of binary sequences with three cross correlation values are presented. The cross correlation values are shown to be low. Finally we present some numerical results and some open problems.

Information Theory · Computer Science 2015-03-20 Jinquan Luo

For an odd prime $p$ and $n=2m$, a new decimation $d=\frac{(p^{m}-1)^{2}}{2}+1$ of Niho type of $m$-sequences is presented. Using generalized Niho's Theorem, we show that the cross-correlation function between a $p$-ary $m$-sequence of…

Information Theory · Computer Science 2011-05-16 Yuhua Sun , Hui Li , Zilong Wang , Tongjiang Yan

Let $d=\frac{(3^{2k}+1)^{2}}{20}$, where $k$ is an odd integer. We show that the magnitude of the cross-correlation values of a ternary $m$-sequence $\{s_{t}\}$ of period $3^{4k}-1$ and its decimated sequence $\{s_{dt}\}$ is upper bounded…

Information Theory · Computer Science 2011-05-16 Yuhua Sun , Zilong Wang , Hui Li

Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation…

Information Theory · Computer Science 2017-03-28 Kelly T. R. Boothby , Daniel J. Katz

Pursley and Sarwate established a lower bound on a combined measure of autocorrelation and crosscorrelation for a pair $(f,g)$ of binary sequences (i.e., sequences with terms in $\{-1,1\}$). If $f$ is a nonzero sequence, then its…

Information Theory · Computer Science 2022-03-08 Daniel J. Katz , Eli Moore

The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…

Information Theory · Computer Science 2020-07-31 Minghui Yang , Keqin Feng

In this paper, we completely determine the cross correlation distribution between an $m$-sequence $(s_t)$ of period $p^n-1$ and its $d$-decimated sequence $(s_{dt})$, where $d = \frac{p^n-1}{3} + p^i$, $p \equiv 1 \pmod{3}$,…

Information Theory · Computer Science 2026-05-20 Yuehui Cui , Jinquan Luo

Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…

Information Theory · Computer Science 2025-01-07 Daniel J. Katz , Adeebur Rahman , Michael J Ward

The sequence pairs of length $2^{m}$ projected from complementary array pairs of Type-II of size $\mathbf{2}^{(m)}$ and mixed Type-II/III and of size $\mathbf{2}^{(m-1)}\times2$ are complementary sequence pairs Type-II and Type-III…

Information Theory · Computer Science 2022-08-02 Erzhong Xue , Zilong Wang , Jinjin Chai

Pseudorandom sequences are used extensively in communications and remote sensing. Correlation provides one measure of pseudorandomness, and low correlation is an important factor determining the performance of digital sequences in…

Information Theory · Computer Science 2018-06-14 Daniel J. Katz
‹ Prev 1 2 3 10 Next ›