Linearized trinomials with maximum kernel
From MaRDI portal
Linearized trinomials with maximum kernel (scientific article)
Abstract: Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let be a prime power, be a positive integer and be a generator of . In this paper we provide closed formulas for the coefficients of a -trinomial over which ensure that the dimension of the kernel of 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 and . 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].
This page was built for publication: Linearized trinomials with maximum kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6357178)