Multiplication algorithm in a finite field and tensor rank of the multiplication.
type: Item
instance of: scholarly article
title: Multiplication algorithm in a finite field and tensor rank of the multiplication.
zbMATH Open document ID: 1077.11084
author: S. Ballet
author: Robert Rolland
published in: Journal of Algebra
publication date: 2004-03-15T00:00:00Z
Mathematics Subject Classification ID: 11R58
Mathematics Subject Classification ID: 11G20
zbMATH DE Number: 2057669
zbMATH Keywords: Bilinear complexity
zbMATH Keywords: Finite field
zbMATH Keywords: Algebraic function field
MaRDI profile type: Publication
full work available at URL: j.jalgebra.2003.09.031
OpenAlex ID: W1964254344
cites work: Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
cites work: Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
cites work: Algebraic complexities and algebraic curves over finite fields
cites work: A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
cites work: Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
cites work: Lectures on the theory of algebraic functions of one variable
cites work: A new construction of algebraic-geometry codes
cites work: Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
cites work: Q4027646
cites work: Algebraic Function Fields and Codes
cites work: On multiplication in algebraic extension fields
DOI: 10.1016/J.JALGEBRA.2003.09.031
description: scientific article; zbMATH DE number 2057669