Pollard, J. M. The fast Fourier transform in a finite field. (English) Zbl 0221.12015 Math. Comput. 25, 365-374 (1971). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 35 Documents MSC: 11T99 Finite fields and commutative rings (number-theoretic aspects) 43A32 Other transforms and operators of Fourier type 11Y55 Calculation of integer sequences 11Y11 Primality × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Iain T. Adamson, Introduction to field theory, Oliver & Boyd, Edinburgh-London; Interscience Publishers, Inc. John Wiley & Sons, Inc. New York, 1964. · Zbl 0479.12007 [2] James W. Cooley and John W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comp. 19 (1965), 297 – 301. · Zbl 0127.09002 [3] W. M. Gentleman, ”Matrix multiplication and fast Fourier transformations,” Bell System Tech J., v. 47, 1968, pp. 1099-1102. · Zbl 0187.12602 [4] G. D. Bergland, ”A guided tour of the fast Fourier transform,” IEEE Spectrum, v. 6, no. 7, 1969, pp. 41-53. [5] L. I. Bluestein, A Linear Filtering Approach to the Computation of the Discrete Fourier Transform, Northeast Electronics Research and Engineering Meeting Record, v. 10, 1968, pp. 218-219. [6] Solomon W. Golomb, Shift register sequences, With portions co-authored by Lloyd R. Welch, Richard M. Goldstein, and Alfred W. Hales, Holden-Day, Inc., San Francisco, Calif.-Cambridge-Amsterdam, 1967. · Zbl 0267.94022 [7] Computers in mathematical research, Edited by R. F. Churchhouse and J.-C. Herz, North-Holland Publishing Co., Amsterdam, 1968. · Zbl 0165.29703 [8] G. H. Hardy & E. M. Wright, An Introduction to the Theory of Numbers, Clarendon Press, Oxford, 1938. · Zbl 0020.29201 [9] N. S. Szabo & R. I. Tanaba, Residue Arithmetic and its Applications to Computer Technology, McGraw-Hill, New York, 1967. · Zbl 0168.15303 [10] Donald B. Gillies, Three new Mersenne primes and a statistical theory, Math. Comp. 18 (1964), 93 – 97. · Zbl 0121.28305 [11] H. Davenport, The higher arithmetic. An introduction to the theory of numbers, Hutchinson’s University Library, London; Longmans, Green and Co., Inc., New York, N. Y., 1952. · Zbl 0049.30901 [12] George E. Collins, Computing multiplicative inverses in \?\?(\?), Math. Comp. 23 (1969), 197 – 200. · Zbl 0191.05605 [13] Eugene R. Rodemich and Howard Rumsey Jr., Primitive trinomials of high degree, Math. Comp. 22 (1968), 863 – 865. · Zbl 0175.03902 [14] W. K. Pratt, J. Kane & H. C. Andrews, ”Hadamard transform image coding,” Proc. IEEE, v. 57, 1969, pp. 58-68. [15] Error correcting codes, Proceedings of a symposium conducted by the Mathematics Research Center, United States Army at the University of Wisconsin, Madison, Wis., May 6-8, vol. 1968, John Wiley & Sons, Inc., New York-London-Sydney, 1968. · Zbl 0213.21302 [16] Harry Pollard, The Theory of Algebraic Numbers, Carus Monograph Series, no. 9, The Mathematical Association of America, Buffalo, N. Y., 1950. · Zbl 0041.01105 [17] W. T. Cochran et al., ”What is the fast Fourier transform?” Proc. IEEE, v. 55, 1967, pp. 1664-1674. This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.