Matrices of finite abelian groups, finite Fourier transform and codes.
From MaRDI portal
Abstract: Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of cyclic groups. In this regard, we introduce a generalization of the previous investigations to the case of finite groups, abelian or not. We make clear the points which were not recognized as underlying algebraic structures. Especially, all that appears in the FFT in engineering has been elucidated from the point of view of linear representations of finite groups. We include many worked-out examples for the readers in engineering disciplines.
Recommendations
Cited in
(7)- Integral Cayley graphs over a finite symmetric algebra
- Equilibria in Kuramoto Oscillator Networks: An Algebraic Approach
- On the joins of group rings
- Group Convolutions and Matrix Transforms
- On the arithmetic of join rings over finite fields
- On complex matrix scalings of extremal permanent
- The Four Exponentials Problem and Schanuel’s Conjecture
This page was built for publication: Matrices of finite abelian groups, finite Fourier transform and codes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5416176)