Title :
Cascaded GMW sequences
Author :
Klapper, Andrew ; Chan, A.H. ; Goresky, Mark
Author_Institution :
Dept. of Comput. Sci., Manitoba Univ., Winnipeg, Man., Canada
fDate :
1/1/1993 12:00:00 AM
Abstract :
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
Keywords :
binary sequences; computational complexity; correlation theory; cryptography; cascaded GMW sequences; communication systems; correlation properties; cryptography; high-shifted autocorrelation values; linear complexity; m-sequences; pseudorandom binary sequences; three-valued cross-correlation values; Autocorrelation; Binary sequences; Computer science; Cryptography; Galois fields; Hardware; Milling machines; Random sequences; Security; Shift registers;
Journal_Title :
Information Theory, IEEE Transactions on
