Abstract:
The discrete Fourier transform over a finite field finds applications in algebraic
coding theory. The proposed computation method for the discrete Fourier transform is based
on factorizing the transform matrix into a product of a binary block circulant matrix and a
diagonal block circulant matrix.