On the hull of linearized polynomial codes
Daniele Bartoli, Giovanni Giuseppe Grimaldi, Pantelimon St\u{a}nic\u{a}

TL;DR
This paper investigates the hulls of linearized polynomial codes over finite fields, providing formulas, classifications, and density results relevant to quantum error correction and rank-distance codes.
Contribution
It introduces a unified Gram-matrix method to analyze hull dimensions of linearized polynomial codes, deriving explicit formulas and classifications for various code families.
Findings
Derived a master hull--rank formula for image codes.
Classified hull dimensions for circulant Gram matrices.
Showed LCD point density approaches 1 as q increases.
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…
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.
