메뉴 건너뛰기




Volumn 25, Issue 114, 1971, Pages 365-374

The fast fourier transform in a finite field

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84968484267     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1971-0301966-0     Document Type: Article
Times cited : (322)

References (16)
  • 2
    • 84968470212 scopus 로고
    • An algorithm for the machine calculation of complexFourier series
    • J. W. Cooley, J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comp., v. 19, 1965, p. 297-301.
    • (1965) Math. Comp , vol.19 , pp. 297-301
    • Cooley, J.W.1    Tukey, J.W.2
  • 3
    • 84977686629 scopus 로고
    • Matrix multiplication and fast Fourier transformations
    • W. M. Gentleman, "Matrix multiplication and fast Fourier transformations," Bell System Tech J., v. 47, 1968, p. 1099-1102.
    • (1968) Bellsystem Tech J , vol.47 , pp. 1099-1102
    • Gentleman, W.M.1
  • 4
    • 0014534819 scopus 로고
    • A guided tour of the fast Fourier transform
    • G. D. Bergland, "A guided tour of the fast Fourier transform," IEEE Spectrum, v. 6, no. 7, 1969, p. 41-53.
    • (1969) IEEE Spectrum , vol.6 , Issue.7 , pp. 41-53
    • Bergland, G.D.1
  • 5
    • 20744444659 scopus 로고
    • A Linear Filtering Approach to the Computation of the Discrete Fourier Transform
    • 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, p. 218-219.
    • (1968) Northeast Electronics Research and Engineering Meeting Record , vol.10 , pp. 218-219
    • Bluestein, L.I.1
  • 6
    • 0004201481 scopus 로고
    • Shift Register Sequences
    • San Francisco, Calif
    • S. W. Golomb, Shift Register Sequences, Holden-Day, San Francisco, Calif., 1967.
    • (1967) Holden-Day
    • Golomb, S.W.1
  • 10
    • 84968487135 scopus 로고
    • Three new Mersenne primes and a statistical theory
    • D. B. Gillies, "Three new Mersenne primes and a statistical theory," Math. Comp., v. 18, 1964, p. 93-97.
    • (1964) Math. Comp , vol.18 , pp. 93-97
    • Gillies, D.B.1
  • 12
    • 84968491427 scopus 로고
    • Computing multiplicative inverses in GF(p)
    • G. E. Collins, "Computing multiplicative inverses in GF(p)," Math. Comp., v. 23, 1969, p. 197-200.
    • (1969) Math. Comp , vol.23 , pp. 197-200
    • Collins, G.E.1
  • 13
    • 84968466139 scopus 로고
    • Primitive trinomials of high degree
    • E. P. Rodemich, H. Rumsey, "Primitive trinomials of high degree," Math. Comp., v. 22, 1968, p. 863-865.
    • (1968) Math. Comp , vol.22 , pp. 863-865
    • Rodemich, E.P.1    Rumsey, H.2
  • 14
    • 80054689517 scopus 로고
    • Hadamard transform image coding
    • W. K. Pratt, J. Kane, H. C. Andrews, "Hadamard transform image coding," Proc. IEEE, v. 57, 1969, p. 58-68.
    • (1969) Proc. IEEE , vol.57 , pp. 58-68
    • Pratt, W.K.1    Kane, J.2    Andrews, H.C.3
  • 15
    • 84968517440 scopus 로고
    • The Theory of Algebraic Numbers, Carus Math
    • Distributed by Wiley, New York
    • H. Pollard, The Theory of Algebraic Numbers, Carus Math. Monographs, Math. Assoc. Amer.; Distributed by Wiley, New York, no. 9 1950.
    • (1950) Monographs, Math. Assoc. Amer , vol.9
    • Pollard, H.1
  • 16
    • 84910217597 scopus 로고
    • What is the fast Fourier transform
    • W. T. Cochran, "What is the fast Fourier transform" Proc. IEEE, v. 55, 1967, p. 1664-1674.
    • (1967) Proc. IEEE , vol.55 , pp. 1664-1674
    • Cochran, W.T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.