On symmetric algorithms for bilinear forms over finite fields

DOI10.1016/0196-6774(84)90014-2MaRDI QIDQ3698312zbMATH OpenOpenAlexFDO

Authors Gadiel Seroussi, Abraham Lempel

Publication date 1984

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(84)90014-2

zbMATH Keywords

bilinear complexitycomputation of symmetric systems of bilinear formscosetscyclic codemaximum-likelihood decodingsymmetric bilinear algorithmssymmetric complexity

Mathematics Subject Classification ID

General binary quadratic forms (11E16) Finite fields and commutative rings (number-theoretic aspects) (11T99) Quadratic and bilinear forms, inner products (15A63) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99) Cyclic codes (94B15) Decoding (94B35)

Recommendations

• Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
• Optimal evaluation of pairs of bilinear forms
• Symmetric bilinear forms over finite fields with applications to coding theory
• Symmetric rank codes
• Algebraic complexities and algebraic curves over finite fields

Cited in

(6)

• Trisymmetric multiplication formulae in finite fields
• Symmetric bilinear forms over finite fields with applications to coding theory
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• Effective structure theorems for symplectic spaces via height
• Chudnovsky-type algorithms over the projective line using generalized evaluation maps
• Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)

This page was built for publication: On symmetric algorithms for bilinear forms over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698312)