English

On the hull of linearized polynomial codes

Information Theory 2026-04-28 v1 math.IT Number Theory

Abstract

Motivated by entanglement-assisted quantum error-correcting codes, where the hull dimension determines the number of required pre-shared entangled pairs, we study hulls of two families of Fq\mathbb{F}_q-linear codes defined by qq-polynomial operators over Fqm\mathbb{F}_{q^m}. Our main tool is a unified Gram-matrix method. For image codes C(α)=imΦα\mathcal{C}(\boldsymbol{\alpha})=\operatorname{im}\Phi_{\boldsymbol{\alpha}}, with Φα=iαiFi\Phi_{\boldsymbol{\alpha}}=\sum_i\alpha_iF_i, we prove the master hull--rank formula dimHull(C(α))=rank(Φα)rank(G(α))\dim\operatorname{Hull}(\mathcal{C}(\boldsymbol{\alpha}))=\operatorname{rank}(\Phi_{\boldsymbol{\alpha}})-\operatorname{rank}(G(\boldsymbol{\alpha})), where G(α)G(\boldsymbol{\alpha}) is the associated Gram matrix over Fq\mathbb{F}_q. Specializing to Cλ,μ=im(λx+μL(x))C_{\lambda,\mu}=\operatorname{im}(\lambda x+\mu L(x)), we obtain a quadratic Gram pencil λ2G0+λμG1+μ2G2\lambda^2G_0+\lambda\mu G_1+\mu^2G_2 whose determinant describes the LCD locus in P1(Fq)\mathbb{P}^1(\mathbb{F}_q). We also treat Fqm\mathbb{F}_{q^m}-linear rank-distance codes C=X,F1,,FkFqm\mathcal{C}=\langle X,F_1,\ldots,F_k\rangle_{\mathbb{F}_{q^m}} with the Delsarte inner product, where a k×kk\times k Gram matrix over Fqm\mathbb{F}_{q^m} determines the hull dimension. For L(X)=XqkL(X)=X^{q^k}, with d=gcd(k,m)d=\gcd(k,m), the resulting circulant Gram matrices yield a closed-form discriminant and a complete classification in three of the four bijectivity configurations over P1(Fqm)\mathbb{P}^1(\mathbb{F}_{q^m}). In the remaining case, the hull dimension equals δ=dimFq(imϕλ,μkerϕλ,μ)\delta=\dim_{\mathbb{F}_q}(\operatorname{im}\phi_{\lambda,\mu}\cap\ker\phi_{\lambda,\mu}^{\dagger}), and the extremal condition δ=d\delta=d is characterized by an explicit trace-isotropy criterion. We conclude with an exact count of LCD and non-LCD points, showing that the LCD density tends to 11 as qq\to\infty, together with a worked example over F64\mathbb{F}_{64} and a SageMath verification.

Keywords

Cite

@article{arxiv.2604.23097,
  title  = {On the hull of linearized polynomial codes},
  author = {Daniele Bartoli and Giovanni Giuseppe Grimaldi and Pantelimon Stănică},
  journal= {arXiv preprint arXiv:2604.23097},
  year   = {2026}
}
R2 v1 2026-07-01T12:34:45.178Z