Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.25722

Frobenius Profiles of Polynomial-Multiple MRD Codes

Yangcheng Li·Pingzhi Yuan
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study Frobenius intersection profiles of maximum rank distance (MRD) codes arising from ordinary polynomial multiples over finite fields. We prove that every numerically admissible profile is realized within this family over every sufficiently large extension, using a root-exponent pattern independent of the extension degree. A factor-orbit gap formula provides the underlying structural description, while effective extension-degree bounds guarantee realization. We also establish a lower bound valid for all polynomial generators and show that the upper and lower bounds differ by only $O_q(\log n)$ along an infinite family of parameters. Finally, we characterize the generalized Gabidulin members and obtain non-generalized-Gabidulin realizations of every profile with initial loss at least two over infinitely many extensions.

Explore related subjects

math.NTcs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yangcheng Li, Pingzhi Yuan. 2026-10-19. Frobenius Profiles of Polynomial-Multiple MRD Codes. https://arxiv.org/abs/2610.25722

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Dynamical systems defined by polynomials with algebraic properties

Let (x_n; n\in Z) be a bisequence of elements x_n in the 1-dimensional torus R/Z, which is called a stream over R/Z. Let P(z)=a_k z^k+...+a_1 z+a_0 be a polynomial with integer coefficients. Define the set of streams over R/Z such that the convolution product P(z)\times(x_n; n\in Z)=(\sum_{i=0}^k a_i x_{n-i}; n\in Z)=(0; n\in Z), which is called the stream 0 of P. We study similarities between stream 0 of P and the roots of P(z)=0.

math.NT↗
arXiv2026

Effective existence of primitive k-normal elements via affine spaces

Let $\mathbb{F}_{q^n}$ be the finite field with $q^n$ elements. An element $α\in \mathbb{F}_{q^n}$ is $k$-normal over $\mathbb{F}_q$ if $α$ and its conjugates span an $\mathbb{F}_q$-subspace of dimension $n-k$. It is known that, for $q$ sufficiently large, a primitive $k$-normal element exists if and only if there exists a $k$-normal element free of binomials, but the lower bound on $q$ is not explicit. We count the $k$-normal elements in specific affine subspaces of $\mathbb{F}_{q^n}$ and show that, in some of them, all but at most one element is $k$-normal. Combining this with character sum estimates over affine spaces and a sieve, we obtain an explicit lower bound on $q$ above which a primitive $k$-normal element exists, provided there is a $k$-normal element free of binomials whose $\mathbb{F}_q$-order has a linear factor or is irreducible. As an application, we compute these bounds for $5 \le n \le 8$ and give a complete characterization of the existence of primitive $k$-normal elements in $\mathbb{F}_{q^6}$ over $\mathbb{F}_q$.

math.NT↗