Linear complexity, k-error linear complexity, and the discrete Fourier transform

Journal of Complexity

Volumn 18, Issue 1, 2002, Pages 87-103

  Meidl, Wilfried ^a   Niederreiter, Harald ^b  

^a ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Discrete Fourier transform; k error linear complexity; Linear complexity; Periodic sequences

Indexed keywords

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

References (12)

1. "Theory and Practice of Error Control Codes"
2. "Finite Fields: Structure and Arithmetics"
3. n
4. "Introduction to Finite Fields and Their Applications"
5. Review of R.E. Blahut, Theory and Practice of Error Control Codes
6. A Fourier transform approach to the linear complexity of nonlinearly filtered sequences
7. Counting functions and expected values in the stability theory of stream ciphers
8. "Analysis and Design of Stream Ciphers"
9. Stream ciphers
10. n
11. "An Introduction to Cryptology"