The Fast Fourier Transform in a Finite Field
- 1 April 1971
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 25 (114), 365-374
- https://doi.org/10.2307/2004932
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.Keywords
This publication has 5 references indexed in Scilit:
- Shift Register SequencesPublished by World Scientific Pub Co Pte Ltd ,2014
- Primitive Trinomials of High DegreeMathematics of Computation, 1968
- Introduction to Field Theory. By Iain T. Adamson. Pp. viii, 180, 12s. 6d. 1964. (Oliver and Boyd : University Mathematical Texts)The Mathematical Gazette, 1965
- An Algorithm for the Machine Calculation of Complex Fourier SeriesMathematics of Computation, 1965
- Three New Mersenne Primes and a Statistical TheoryMathematics of Computation, 1964