The discrete Fourier transform of a recurrent sequence (Q1392663): Difference between revisions

Let \(F_{q}\) be a finite field, and \((s_{i})_{i \geq 0}\) a maximal period linear recurring sequence in \(F_{q}\) with the primitive characteristic polynomial \[ f(x)=x^{n}-a_{n-1}x^{n-1}- \cdots -a_{0} \in F_{q}[x] \] Let \( \vartheta\) be the primitive element of \(F_{q^{n}}\) such that \[ f(x)= \prod_{i=0}^{n-1} (1- \vartheta^{q^{i}} x), \] \(g= \vartheta^{(q^{n}-1)/(q-1)}=(-1)^{n-1}a_{0}\) the corresponding primitive element of \(F_{q}\), and \(u\) a complex-valued function on \(F_{q}\). Using properties of \textit{P. Langevin}'s character sums [Contemp. Math. 168, 213-216 (1994; Zbl 0821.11063)] the author proves the validity of some easy relations between the discrete Fourier coefficients of the sequences \((u(s_{i}))_{i \geq 0}\) and \((u(g^{i}))_{i \geq 0}\) stated earlier without proof by \textit{H. A. Barker} [Proc. IEEE 332, 556-561 (1991)].