English
Related papers

Related papers: Period-Different $m$-Sequences With At Most A Four…

200 papers

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

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

{\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

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

For the complete five-valued cross-correlation distribution between two $m$-sequences ${s_t}$ and ${s_{dt}}$ of period $2^m-1$ that differ by the decimation $d={{2^{2k}+1}\over {2^k+1}}$ where $m$ is odd and $\mbox{gcd}(k,m)=1$, Johansen…

Information Theory · Computer Science 2013-10-08 Xiaogang Liu , Michael Harrison , Yuan Luo

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

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

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…

Information Theory · Computer Science 2023-09-21 Xiaoyan Jing , Keqin Feng

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

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

A new method is used to resolve a long-standing conjecture of Niho concerning the crosscorrelation spectrum of a pair of maximum length linear recursive sequences of length $2^{2 m}-1$ with relative decimation $d=2^{m+2}-3$, where $m$ is…

Number Theory · Mathematics 2021-07-12 Tor Helleseth , Daniel J. Katz , Chunlei Li

Like other pseudorandom sequences, decimal sequences may be used in designing a Code Division Multiple Access (CDMA) system. They appear to be ideally suited for this since the cross-correlation of d-sequences taken over the LCM of their…

Information Theory · Computer Science 2008-04-22 Sandeep Chalasani

In this paper, new families of quadriphase sequences with larger linear span and size have been proposed and studied. In particular, a new family of quadriphase sequences of period $2^n-1$ for a positive integer $n=em$ with an even positive…

Information Theory · Computer Science 2011-01-19 Wenping Ma

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

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, 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

In this paper, for an odd prime $p$ such that $p\equiv 3\bmod 4$, odd $n$, and $d=(p^n+1)/(p^k+1)+(p^n-1)/2$ with $k|n$, the value distribution of the exponential sum $S(a,b)$ is calculated as $a$ and $b$ run through $\mathbb{F}_{p^n}$. The…

Information Theory · Computer Science 2012-05-29 Sung-Tai Choi , Ji-Youp Kim , Jong-Seon No

For non-negative integers $n$, $m$, $a$ and $b$, we write $\left( n,m \right) \rightarrow \left( a,b \right)$ if for every family $\mathcal{F}\subseteq 2^{[n]}$ with $|\mathcal{F}|\geqslant m$ there is an $a$-element set $T\subseteq [n]$…

Combinatorics · Mathematics 2024-06-28 Mingze Li , Jie Ma , Mingyuan Rong

Su et al. proposed several new classes of quaternary sequences of even length with optimal autocorrelation interleaved by twin-prime sequences pairs, GMW sequences pairs or binary cyclotomic sequences of order four in \cite{S1}. In this…

Information Theory · Computer Science 2022-09-22 Xiaoyan Jing , Zhefeng Xu , Minghui Yang , Keqin Feng

Given two non-negative integers $n$ and $s$, define $m(n,s)$ to be the maximal number such that in every hypergraph $\mathcal{H}$ on $n$ vertices and with at most $ m(n,s)$ edges there is a vertex $x$ such that $|\mathcal{H}_x|\geq |…

Combinatorics · Mathematics 2020-07-09 Simón Piga , Bjarne Schülke
‹ Prev 1 2 3 10 Next ›