1. H. Bauer, Probability Theory and Elements of Measure Theory, Holt, Rinehart, and Winston, New York, 1972.
2. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Comput., 13 (1984), 850–864.
3. L. Brynielsson, On the linear complexity of combined shift registers, Proceedings of Eurocrypt 1985, Springer-Verlag, Berlin, 1985, pp. 156–160.
4. A. H. Chan and R. Games, On the linear span of binary sequences from finite geometries, q odd, Advances in Cryptology: Proceedings of Crypto 1986, Springer-Verlag, Berlin, 1987, pp. 405–417.
5. S. Golomb, Shift Register Sequences, Aegean Park Press, Laguna Hills, CA, 1982.