Generalizing the discrete Fourier transform

DOI10.1016/0012-365X(85)90016-0zbMath0618.65145MaRDI QIDQ1822477

Thomas Beth

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

convolutionirreducible representationsinversionsignal processingphase shiftcoding theorysplitting fieldprime fieldpicture processinggeneralized discrete Fourier transformParseval- Plancherel-identitysemisimple group algebrasimple Wedderburn components

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Signal detection and filtering (aspects of stochastic processes) (60G35) Numerical methods for trigonometric approximation and interpolation (65T40) Applications of group representations to physics and other areas of science (20C35) Decoding (94B35)

Related Items (3)

A new characterization of dual bases in finite fields and its applications ⋮ On the self-dual normal bases and their distribution ⋮ Trace-orthogonal normal bases

Cites Work

• Unnamed Item
• Fast Fourier transform and convolution algorithms
• Zur Algebraischen Diskreten Fourier-Transformation
• The complexity of group algebra computations
• Fast Fourier Transforms on Finite Non-Abelian Groups
• Endliche Gruppen I

This page was built for publication: Generalizing the discrete Fourier transform