Calculation of correlation function of binary periodic sequences

Publication date 19 April 1998

Published in Chinese Science Bulletin (Search for Journal in Brave)

binary Kasami sequences correlation functions exponential sums generalized Kasami sequences periodic sequences quadratic forms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Review text

Let \(m,n,e\) be positive integers and \(n=em\), \( N=2^{n}-1\), \(T=2^{m}+1\), \(\alpha\) be a primitive element of \(\text{GF}(2^{n})\). The family of \(2^{n}\) binary sequences \( \{s_{i}(t) \mid 0\leq t\leq N-1, 1\leq i\leq 2^{n}\}\), where \(s_{i}(t)=tr_{1}^{m}{tr_{m}^{n}(\alpha^{t}+ \beta_{i}\alpha^{Tt})}\) and \(\beta_{i}\) \((1\leq i\leq 2^{n})\) runs through all elements of \(\text{GF}(2^{n})\), is introduced by the author and is called a family of generalized Kasami sequences. It is the family of binary Kasami sequences defined in ``Spread spectrum communication. Vol. 1 by \textit{M. K. Simon} and \textit{J. K. Omura} [Rockville MD: Computer Science Press (1985)] when \(e=2\). Let \(R_{i,j}(x)\) denote the correlation function of \(s_{i}(t)\) and \(s_{j}(t)\). It is proved in this paper that \[ R_{i,j}(x)\in \{2^{n}-1,\;-1,\;2^{n/2}-1,\;-2^{n/2}-1,\;2^{(e+2)m/2}-1,\;-2^{(e+2)m/2}-1 \] when \(e\) is even and \[ R_{i,j}(x)\in \{2^{n}-1,\;-1,\;2^{(e+1)m/2}-1,\;-2^{(e+1)m/2} -1\} \] when \(e\) is odd. The Welch bound can be reached under certain conditions.

Recommendations

Cited in

(10)

This page was built for publication: Calculation of correlation function of binary periodic sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373812)