Linearized polynomial maps over finite fields

Abstract

We consider polynomial maps described by so-called (multivariate) linearized polynomials. These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps without mixed terms over a characteristic zero field, we will only obtain (up to a linear transformation of the variables) triangular maps, which are the most basic examples of polynomial automorphisms. However, over the finite field F q automorphisms defined by linearized polynomials have (in general) an entirely different structure. Namely, we will show that the linearized polynomial maps over F q are in one-to-one correspondence with matrices having coefficients in a univariate polynomial ring over F q . Furthermore, composition of polynomial maps translates to matrix multiplication, implying that invertible linearized polynomial maps correspond to invertible matrices.This alternate description of the linearized polynomial automorphism subgroup leads to the solution of many famous conjectures (most notably, the Jacobian Conjecture) for this kind of polynomials and polynomial maps.

Explicit constructions of some non-Gabidulin linear maximum rank distance codes

“…(2) u0,...,u k−1 (T ) as in Proposition 1. Then, C (1) and C (2) are equivalent if and only if there exist linearized permutation polynomials…”

“…In case m = n, also the equation C = XC t Y is considered for the equivalence definition, where the superscript t denotes the transposition of matrices. However, we consider only (1) in the equivalence definition, and examine the transposed code C t of a code C separately in this paper. There are similar equivalence ideas in the literature [2,8,10].…”