Integer Convolutions over the Finite Field $GF( {3 \cdot 2^n + 1} )$
- 1 March 1977
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 32 (2) , 356-365
- https://doi.org/10.1137/0132029
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Complex integer convolutions over a direct sum of Galois fieldsIEEE Transactions on Information Theory, 1975
- Fast convolution with finite field fast transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1975
- 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
- Fast Convolution using fermat number transforms with applications to digital filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Discrete Convolutions via Mersenne TransformsIEEE Transactions on Computers, 1972
- The fast Fourier transform in a finite fieldMathematics of Computation, 1971