Work

The Fast Fourier Transform in a Finite Field

Year: 1971
Type: article
Abstract: A transform analogous to the discrete Fourier transform may be defined in a finite field, and may be calculated efficiently by the ’fast Fourier transform’ algorithm. The transform may be applied to the problem of calculating convolutions of long integer sequences by means of integer arithmetic.
Language: English
Open Access status: bronze
OpenAlex ID: W2069448237
FWCI: 4.327
Cites: 25
Cited by: 488
Related to: 10