On symmetric algorithms for bilinear forms over finite fields
Authors:
- 30 September 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (3) , 327-344
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On Symmetric Representations of Finite FieldsSIAM Journal on Algebraic Discrete Methods, 1983
- On the complexity of multiplication in finite fieldsTheoretical Computer Science, 1983
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite FieldsSIAM Journal on Computing, 1980
- On multiplication in algebraic extension fieldsTheoretical Computer Science, 1979
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- On the optimal evaluation of a set of bilinear formsLinear Algebra and its Applications, 1978
- A new approach to error-correcting codesIEEE Transactions on Information Theory, 1977
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970