On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
From MaRDI portal
Publication:4992045
Abstract: In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative understanding of the domain. In particular, we identify and clarify certain results not completely proved and we emphasis the link with open problems in number theory, algebraic geometry, and coding theory.
Recommendations
- New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
- On the bounds of the bilinear complexity of multiplication in some finite fields
- scientific article; zbMATH DE number 606784
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
Cites work
- \((2,1)\)-separating systems beyond the probabilistic bound
- A note on the tensor rank of the multiplication in certain finite fields
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Algebraic complexities and algebraic curves over finite fields
- ALGEBRAICO-GEOMETRIC CODES
- Algebras Having Linear Multiplicative Complexities
- Algorithmic Number Theory
- Algorithms for exponentiation in finite fields
- An explicit result for primes between cubes
- An Improved Lower Bound on Polynomial Multiplication
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
- Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
- Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields
- Asymptotic bounds on frameproof codes
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Canonical models of arithmetic \((1; e)\)-curves
- Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
- Computation of a cover of Shimura curves using a Hurwitz space
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- Dense families of modular curves, prime numbers and uniform symmetric tensor rank of multiplication in certain finite fields
- Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
- Elliptic periods for finite fields
- Families of curves over any finite field attaining the generalized Drinfeld-Vladut bound
- Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
- Finding optimal formulae for bilinear maps
- Gaps between prime numbers and tensor rank of multiplication in finite fields
- scientific article; zbMATH DE number 5896947 (Why is no real title available?)
- scientific article; zbMATH DE number 2134201 (Why is no real title available?)
- scientific article; zbMATH DE number 1186930 (Why is no real title available?)
- scientific article; zbMATH DE number 3771502 (Why is no real title available?)
- scientific article; zbMATH DE number 48941 (Why is no real title available?)
- scientific article; zbMATH DE number 125907 (Why is no real title available?)
- scientific article; zbMATH DE number 125909 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1944661 (Why is no real title available?)
- scientific article; zbMATH DE number 3793939 (Why is no real title available?)
- scientific article; zbMATH DE number 3803619 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- scientific article; zbMATH DE number 3353452 (Why is no real title available?)
- scientific article; zbMATH DE number 2231494 (Why is no real title available?)
- Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of F_q
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Multiplication algorithm in a finite field and tensor rank of the multiplication.
- Multiplication of polynomials modulo \(x^n\)
- Multiplication of Polynomials over Finite Fields
- New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
- On multiplication in algebraic extension fields
- On multiplication in finite fields
- On products and powers of linear codes under componentwise multiplication
- On some bounds for symmetric tensor rank of multiplication in finite fields
- On symmetric algorithms for bilinear forms over finite fields
- On tame towers over finite fields
- On the bilinear complexity of the multiplication in small finite fields
- On the bounds of the bilinear complexity of multiplication in some finite fields
- On the complexity of multiplication in finite fields
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation
- On the existence of dimension zero divisors in algebraic function fields defined over F_q
- On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\)
- On the optimal evaluation of a set of bilinear forms
- On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
- On the tensor rank of multiplication in any extension of \(\mathbb F_2\)
- On the tensor rank of the multiplication in the finite fields
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- Proceedings of the IEEE information theory workshop, ITW'10, Dublin, Ireland, August 30 -- September 3, 2010
- Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
- Shimura curves of genus at most two
- Shimura modular curves and asymptotic symmetric tensor rank of multiplication in any finite field
- Some bilinear forms whose multiplicative complexity depends on the field of constants
- Testers and their applications
- The difference between consecutive primes. II
- Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of \(\mathbb{F}_2\) and \(\mathbb{F}_3\)
Cited in
(25)- Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields
- The tensor rank of semifields of order 16 and 81
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- Non-minimum tensor rank Gabidulin codes
- Trisymmetric multiplication formulae in finite fields
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
- The equivariant complexity of multiplication in finite field extensions
- Shimura modular curves and asymptotic symmetric tensor rank of multiplication in any finite field
- scientific article; zbMATH DE number 5896947 (Why is no real title available?)
- ON THE TENSOR PRODDUCT OF EXTENSIONS OF A FIELD
- scientific article; zbMATH DE number 3877322 (Why is no real title available?)
- scientific article; zbMATH DE number 125907 (Why is no real title available?)
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- scientific article; zbMATH DE number 606784 (Why is no real title available?)
- scientific article; zbMATH DE number 637479 (Why is no real title available?)
- The quadratic hull of a code and the geometric view on multiplication algorithms
- Chudnovsky-type algorithms over the projective line using generalized evaluation maps
- Chaining multiplications in finite fields with Chudnovsky-type algorithms and tensor rank of the k-multiplication
- Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
- Finite field arithmetic in large characteristic for classical and post-quantum cryptography
- Determinantal polynomials and the base polynomial of a square matrix over a finite field
- Introducing locality in some generalized AG codes
- Quantum circuit implementation for \(\mathbb{F}_{2^8}\) multiplication based on algebraic curve method
- Multiplication in finite fields with Chudnovsky-type algorithms over the projective line
- On the non-special divisors in algebraic function fields defined over finite fields
This page was built for publication: On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4992045)
