A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime
- 1 October 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 27 (5) , 561-563
- https://doi.org/10.1109/tassp.1979.1163287
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Addendum to Fast algorithm for computing complex number-theoretic transformsElectronics Letters, 1978
- Fast algorithm for computer complex number-theoretic transformsElectronics Letters, 1977
- Integer Convolutions over the Finite Field $GF( {3 \cdot 2^n + 1} )$SIAM Journal on Applied Mathematics, 1977
- Fast complex convolution in finite ringsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Number theoretic transforms to implement fast digital convolutionProceedings of the IEEE, 1975
- The use of finite fields to compute convolutionsIEEE Transactions on Information Theory, 1975
- Discrete Convolutions via Mersenne TransformsIEEE Transactions on Computers, 1972
- Schnelle Multiplikation großer ZahlenComputing, 1971
- The Fast Fourier Transform in a Finite FieldMathematics of Computation, 1971