On the hull of linearized polynomial codes
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 -linear codes defined by -polynomial operators over . Our main tool is a unified Gram-matrix method. For image codes , with , we prove the master hull--rank formula , where is the associated Gram matrix over . Specializing to , we obtain a quadratic Gram pencil whose determinant describes the LCD locus in . We also treat -linear rank-distance codes with the Delsarte inner product, where a Gram matrix over determines the hull dimension. For , with , the resulting circulant Gram matrices yield a closed-form discriminant and a complete classification in three of the four bijectivity configurations over . In the remaining case, the hull dimension equals , and the extremal condition 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 as , together with a worked example over 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}
}