The discrete Fourier transform of a recurrent sequence

DOI10.1007/S002000050085MaRDI QIDQ1392663zbMATH OpenOpenAlexFDO

Authors Francis Clarke

Publication date 17 September 1999

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000050085

zbMATH Keywords

signal theoryfinite fieldscharacter sumsrecurrent sequences

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Recurrences (11B37) Other character sums and Gauss sums (11T24) Finite fields and commutative rings (number-theoretic aspects) (11T99) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 1047548
• ON THE DISTRIBUTION OF POWER RESIDUES AND PRIMITIVE ELEMENTS IN SOME NONLINEAR RECURRING SEQUENCES
• Matrices and linear recurrences in finite fields
• A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence

Cited in

(5)

• scientific article; zbMATH DE number 54567 (Why is no real title available?)
• Character sums and nonlinear recurrence sequences
• A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence
• On recursive discrete Fourier transformation
• Hadamard transforms of pure-duple rhythms

This page was built for publication: The discrete Fourier transform of a recurrent sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392663)