A Method for Fast Computation of the Fourier Transform over a Finite Field

Authors:
P. V. Trifonov;S. V. Fedorenko
Affiliations:
St. Petersburg State Polytechnic University ptrifonov@ieee.org;St. Petersburg State Polytechnic University sfedorenko@ieee.org
Venue:
Problems of Information Transmission
Year:
2003

Citing 2
Cited 4

Fast Algorithms for Digital Signal Processing

Fast Algorithms for Digital Signal Processing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Simplified procedure for decoding nonsystematic reed-Solomon codes over GF(2m) using Euclid's algorithm and the fast Fourier transform

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

IEEE Transactions on Signal Processing
Fast, prime factor, discrete Fourier transform algorithms over GF(2m) for 8≤m≤10

Information Sciences: an International Journal
Additive fast Fourier transforms over finite fields

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

We consider the problem of fast computation of the Fourier transform over a finite field by decomposing an arbitrary polynomial into a sum of linearized polynomials. Examples of algorithms for the Fourier transform with complexity less than that of the best known analogs are given.