Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let q be a prime power, n be a positive integer and σ be a generator of Gal(Fqjavax.xml.bind.JAXBElement@226d5689:Fq). In this paper we provide closed formulas for the coefficients of a σ-trinomial f over Fqjavax.xml.bind.JAXBElement@4cee590e which ensure that the dimension of the kernel of f equals its σ-degree, that is linearized polynomials with maximum kernel. As a consequence, we present explicit examples of linearized trinomials with maximum kernel and characterize those having σ-degree 3 and 4. Our techniques rely on the tools developed in [24]. Finally, we apply these results to investigate a class of rank metric codes introduced in [8], to construct quasi-subfield polynomials and cyclic subspace codes, obtaining new explicit constructions to the conjecture posed in [37].
Linearized trinomials with maximum kernel
Santonastaso P.;Zullo F.
2022
Abstract
Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let q be a prime power, n be a positive integer and σ be a generator of Gal(Fqjavax.xml.bind.JAXBElement@226d5689:Fq). In this paper we provide closed formulas for the coefficients of a σ-trinomial f over Fqjavax.xml.bind.JAXBElement@4cee590e which ensure that the dimension of the kernel of f equals its σ-degree, that is linearized polynomials with maximum kernel. As a consequence, we present explicit examples of linearized trinomials with maximum kernel and characterize those having σ-degree 3 and 4. Our techniques rely on the tools developed in [24]. Finally, we apply these results to investigate a class of rank metric codes introduced in [8], to construct quasi-subfield polynomials and cyclic subspace codes, obtaining new explicit constructions to the conjecture posed in [37].I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
