On symmetric algorithms for bilinear forms over finite fields

DOI10.1016/0196-6774(84)90014-2zbMath0577.68056OpenAlexW1976961250MaRDI QIDQ3698312

Abraham Lempel, Gadiel Seroussi

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

cyclic codecosetsbilinear complexitymaximum-likelihood decodingcomputation of symmetric systems of bilinear formssymmetric bilinear algorithmssymmetric complexity

Mathematics Subject Classification ID

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

Related Items (3)

Chudnovsky-type algorithms over the projective line using generalized evaluation maps ⋮ Trisymmetric multiplication formulae in finite fields ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

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