Linearized trinomials with maximum kernel

12/29/2020
āˆ™
by   Paolo Santonastaso, et al.
āˆ™
0
āˆ™

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].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
āˆ™ 12/21/2017

Skew cyclic codes over F_p+uF_p

In this paper, we study skew cyclic codes with arbitrary length over the...
research
āˆ™ 06/28/2022

ā„¤_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...
research
āˆ™ 04/22/2020

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...
research
āˆ™ 07/22/2021

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

Goppa codes are particularly appealing for cryptographic applications. E...
research
āˆ™ 10/20/2021

Zeros of quasi-paraorthogonal polynomials and positive quadrature

In this paper we illustrate that paraorthogonality on the unit circle š•‹ ...
research
āˆ™ 11/09/2021

On the structure of 1-generator quasi-polycyclic codes over finite chain rings

Quasi-polycyclic (QP for short) codes over a finite chain ring R are a g...
research
āˆ™ 04/06/2019

Well-Rounded Lattices via Polynomials

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

Please sign up or login with your details

Forgot password? Click here to reset