The quadratic hull of a code and the geometric view on multiplication algorithms

DOI10.1090/conm/770/15440zbMath1497.94178arXiv1912.06627OpenAlexW2994957836MaRDI QIDQ5043439

Hugues Randriambololona

Publication date: 21 October 2022

Published in: Contemporary Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.06627

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Finite fields (field-theoretic aspects) (12E20) Elementary questions in algebraic geometry (14A25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
• Amortized complexity of information-theoretically secure MPC revisited
• Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
• On multiplication in finite fields
• On the optimal evaluation of a set of bilinear forms
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Towards a function field version of Freiman's theorem
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• The non-gap sequence of a subcode of a generalized Reed-Solomon code
• Improved method for finding optimal formulas for bilinear maps in a finite field
• On the unique representation of very strong algebraic geometry codes
• Computational aspects of retrieving a representation of an algebraic geometry code
• Gaussian elimination is not optimal
• On products and powers of linear codes under componentwise multiplication
• Classical Algebraic Geometry
• Finding Optimal Formulae for Bilinear Maps
• Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
• Anticanonical codes from del Pezzo surfaces with Picard rank one
• Which linear codes are algebraic-geometric?
• Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
• ALGEBRAICO-GEOMETRIC CODES
• Some bilinear forms whose multiplicative complexity depends on the field of constants
• Algebras Having Linear Multiplicative Complexities
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• Secure Multiparty Computation and Secret Sharing
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: The quadratic hull of a code and the geometric view on multiplication algorithms