The discrete Fourier transform of a recurrent sequence

Applicable Algebra in Engineering, Communications and Computing

Volumn 8, Issue 6, 1997, Pages 485-489

  Clarke, Francis ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Character sums; Finite fields; Recurrent sequences; Signal theory

Indexed keywords

FINITE ELEMENT METHOD; POLYNOMIALS; SIGNAL THEORY; THEOREM PROVING;

CHARACTER SUMS; DISCRETE FOURIER TRANSFORM; FINITE FIELDS; RECURRENT SEQUENCE;

FOURIER TRANSFORMS;

EID: 0031381687     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000050085     Document Type: Article

References (6)

1. Alanen, J. D., Knuth, D. E.: Tables of finite fields, Sankhya Ser. A 26, 305-328 (1964)
2. Barker, H. A.: Design of multilevel pseudorandom signals for specified harmonic content, Proc. IEE 332, 556-561 (1991)
3. Barker, H. A.: Design of Multi-level Pseudo-random Signals for System Identification, "Perturbation Signals for System Identification" ch. 11, pp. 321-347, Prentice Hall International Series in Acoustics, Speech and Signal Processing, Englewood Cliffs, NJ: Prentice Hall, 1993
4. Langevin, P.: Some sequences with good autocorrelation properties, Finite fields: theory, applications, and algorithms (Las Vegas, NV, 1993), pp. 213-216, Contemp. Math. 168, Amer. Math. Soc., Providence, RI, 1994
5. Lidl, R., Niederreiter, H.: Finite Fields, Encyclopedia of Mathematics and its Applications, vol. 20, Addison-Wesley, Reading, MA, 1983
6. Zierler, N.: Linear recurring sequences, J. Soc. Indust. Appl. Math. 7, 31-48 (1959)