Cascaded GMW Sequences

Pseudorandom binary sequences with high linear complexity and low correlation function values are sought in many applications of modern communication systems. A new family of pseudorandom binary sequences, cascaded GMW sequences, is constructed. These sequences are shown to share many desirable correlation properties with the GMW sequences of B. Gordon, W.A. Mills, and L.R. Welch (1962)-for example, high-shifted autocorrelation values and, in many cases, three-valued cross-correlation values with m-sequences. It is shown, moreover, that in many cases the linear complexities of cascaded GMW sequences are far greater than those of GMW sequences. >

[1]  Mark Goresky,et al.  Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences , 1993, Discret. Appl. Math..

[2]  D. Campana,et al.  Spread-spectrum communications , 1993, IEEE Potentials.

[3]  Oscar Moreno,et al.  Prime-phase sequences with periodic correlation properties better than binary sequences , 1991, IEEE Trans. Inf. Theory.

[4]  Ronald C. Mullin,et al.  Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..

[5]  Richard A. Games,et al.  Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial , 1985, Discret. Appl. Math..

[6]  R. Scholtz,et al.  GMW sequences (Corresp.) , 1984 .

[7]  Laurence B. Milstein,et al.  Spread-Spectrum Communications , 1983 .

[8]  M.B. Pursley,et al.  Crosscorrelation properties of pseudorandom and related sequences , 1980, Proceedings of the IEEE.

[9]  Tor Helleseth,et al.  Some results about the cross-correlation function between two maximal linear sequences , 1976, Discret. Math..

[10]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[11]  Neal Zierler,et al.  Products of linear recurring sequences , 1973 .

[12]  P.H. Siegel,et al.  Finite fields for Computer Scientists and Engineers [Book Review] , 1993, IEEE Transactions on Information Theory.

[13]  Leopold Bömer,et al.  Complex sequences over GF(pM) with a two-level autocorrelation function and a large linear span , 1992, IEEE Trans. Inf. Theory.

[14]  H. Lenstra,et al.  Primitive normal bases for finite fields , 1987 .

[15]  R. Games,et al.  The geometry of m-Sequences: Three-valued crosscorrelations and quadrics in finite projective geometry , 1986 .

[16]  Richard A. Games,et al.  On the Linear Span of binary Sequences Obtained from Finite Geometries , 1986, CRYPTO.

[17]  Lennart Brynielsson,et al.  On the Linear Complexity of Combined Shift Register Sequences , 1985, EUROCRYPT.

[18]  Marvin K. Simon,et al.  Spread spectrum communications. Volume 1, 2 & 3 , 1985 .

[19]  Robert A. Scholtz,et al.  GMW sequences , 1984, IEEE Trans. Inf. Theory.

[20]  H. Niederreiter,et al.  Finite fields , 1983 .

[21]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.