A method for computation of the discrete Fourier transform over a finite field

Authors:
S. V. Fedorenko
Affiliations:
Saint-Petersburg State Polytechnic University, Russia
Venue:
Problems of Information Transmission
Year:
2006

Citing 0
Cited 4

Cyclotomic FFTs with reduced additive complexities based on a novel common subexpression elimination algorithm

IEEE Transactions on Signal Processing
Additive fast Fourier transforms over finite fields

IEEE Transactions on Information Theory
New area-time lower bounds for the multidimensional DFT

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
New area-time lower bounds for the multidimensional DFT

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Quantified Score

Hi-index	0.06

Visualization

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.