Tree complexity and a doubly exponential gap between structured and random sequences

Journal of Complexity

Volumn 12, Issue 3, 1996, Pages 187-198

  Niederreiter, Harald ^a   Vielhaber, Michael ^a  

^a ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030242187     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1996.0014     Document Type: Article

References (8)

1. BAUM, L. E., AND SWEET, M. M. (1976), Continued fractions of algebraic power series in characteristic 2, Ann. Math. 103, 593-610.
2. CHRISTOL, G., KAMAE, T., MENDÈS FRANCE, M., AND RAUZY, G. (1980), Suites algébriques, automates et substitutions, Bull. Soc. Math. France 108, 401-419.
3. DAI, Z.-D. (1986), Proof of Rueppel's linear complexity conjecture, IEEE Trans. Inform. Theory 32, 440-443.
4. DEKKING, M., MENDÈS FRANCE, M., AND VAN DER POORTEN, A. (1983), FOLDS!, The Mathematical Intelligencer 4, 130-138, 173-181, 190-195.
5. FELLER, W. (1968), "An Introduction to Probability Theory and Its Applications I," 3rd ed., Wiley, New York.
6. NIEDERREITER, H. (1988), Sequences with almost perfect linear complexity profile, in "Advances in Cryptology - EUROCRYPT '87" (D. Chaum and W. L. Price, Eds.), pp. 37-51, Lecture Notes in Computer Science, Vol. 304, Springer, Berlin.
7. RUEPPEL, R. A. (1986), "Analysis and Design of Stream Ciphers," Springer, Berlin.
8. RUEPPEL, R. A. (1992), Stream ciphers, in "Contemporary Cryptology - The Science of Information Integrity" (G. J. Simmons, Ed.), pp. 65-134, IEEE Press, New York.