Multiplication algorithm in a finite field and tensor rank of the multiplication

We generalize the multiplication algorithm of D.V. and G.V. Chudnovsky. Using the new algorithm, we improve the upper bounds of the bilinear complexity of multiplication in all extensions of a finite field of characteristic 2. On the other hand, we also improve in characteristic 2 the asymptotic upper bounds of this complexity.