On certain linearized polynomials with high degree and kernel of small dimension
Olga Polverino, Giovanni Zini, Ferdinando Zullo

TL;DR
This paper classifies conditions under which certain high-degree linearized polynomials over finite fields have small kernels, using algebraic geometry tools, and explores implications for rank metric codes and scattered binomials.
Contribution
It provides a classification of parameters for high-degree linearized polynomials with small kernels, linking algebraic curves and intersection theory to finite field polynomial analysis.
Findings
Classified parameters for kernel dimension at most 1 when n ≥ 5 and s=1.
Connected polynomial kernel properties to algebraic curves and intersection theory.
Implications for non-scatteredness of high degree scattered binomials and rank metric codes.
Abstract
Let be the -linear map over defined by with . It is known that the kernel of has dimension at most , as proved by Csajb\'ok et al. in "A new family of MRD-codes" (2018). For big enough, e.g. when , we classify the values of such that the kernel of has dimension at most . To this aim, we translate the problem into the study of some algebraic curves of small degree with respect to the degree of ; this allows to use intersection theory and function field theory together with the Hasse-Weil bound. Our result implies a non-scatteredness result for certain high degree scattered binomials, and the asymptotic classification of a family of rank metric codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Cooperative Communication and Network Coding
