On arithmetical algorithms over finite fields
- 1 March 1989
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 50 (2), 285-300
- https://doi.org/10.1016/0097-3165(89)90020-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A new structured design method for convolutions over finite fields, Part IIEEE Transactions on Information Theory, 1983
- On the complexity of multiplication in finite fieldsTheoretical Computer Science, 1983
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- FFT as Nested Multiplication, with a TwistSIAM Journal on Scientific and Statistical Computing, 1980
- On computing the discrete Fourier transformMathematics of Computation, 1978
- Schnelle Multiplikation von Polynomen ber K rpern der Charakteristik 2Acta Informatica, 1977
- Evaluating Polynomials at Fixed Sets of PointsSIAM Journal on Computing, 1975