DeepAI AI Chat
Log In Sign Up

Linearized trinomials with maximum kernel

by   Paolo Santonastaso, et al.

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(𝔽_q^n𝔽_q). In this paper we provide closed formulas for the coefficients of a σ-trinomial f over 𝔽_q^n 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 [22]. 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 solutions to the conjecture posed in [35].


page 1

page 2

page 3

page 4


Skew cyclic codes over F_p+uF_p

In this paper, we study skew cyclic codes with arbitrary length over the...

ℤ_pℤ_p^2-additive cyclic codes: kernel and rank

A code C = Φ(𝒞) is called ℤ_p ℤ_p^2-linear if it's the Gray image of the...

On certain linearized polynomials with high degree and kernel of small dimension

Let f be the F_q-linear map over F_q^2n defined by x x+ax^q^s+bx^q^n+s w...

Binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes

Goppa codes are particularly appealing for cryptographic applications. E...

Zeros of quasi-paraorthogonal polynomials and positive quadrature

In this paper we illustrate that paraorthogonality on the unit circle 𝕋 ...

On Z_p^rZ_p^rZ_p^s-Additive Cyclic Codes

In this paper, we introduce ℤ_p^rℤ_p^rℤ_p^s-additive cyclic codes for r≤...

Well-Rounded Lattices via Polynomials

Well-rounded lattices have been a topic of recent studies with applicati...