Subsequences of Pseudorandom Sequences
S. Wainberg, Jack K. Wolf · IRE Transactions on Communications Systems · 1970
The properties of subsequences of longmsequences are studied using the moments of the subsequence weight distributions. These moments are shown to be an aid for selecting goodmsequences for correlation-detection problems. In particular, the first four moments are described in detail for subsequence lengthsM \leq 100digits for six differentmsequences. Two simple algorithms are described for determining the third and fourth moments. An algorithm for calculating the fourth moment and a detailed description of this moment for the sixmsequences are presented in this paper. Using the moments, a relationship is shown between the subsequences of the pseudorandom binary sequence and subsequences composed of random binary digits. Estimates for the moments of the subsequence weight distribution are obtained by sampling themsequence. A statistical analysis of these results is presented.