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 Fq-linear codes defined by q-polynomial operators over Fqm. Our main tool is a unified Gram-matrix method. For image codes C(α)=imα, with α=ΣiαiFi, we prove the master hull--rank formula Hull(C(α))=rank(α)-rank(G(α)), where G(α) is the associated Gram matrix over Fq. Specializing to Cλ,μ=im(λ x+μ L(x)), we obtain a quadratic Gram pencil λ2G0+λμ G1+μ2G2 whose determinant describes the LCD locus in P1(Fq). We also treat Fqm-linear rank-distance codes C= X,F1,…,FkFqm with the Delsarte inner product, where a k× k Gram matrix over Fqm determines the hull dimension. For L(X)=Xqk, with d=(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). In the remaining case, the hull dimension equals δ=Fq(imφλ,μφλ,μ), and the extremal condition δ=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 1 as q∞, together with a worked example over F64 and a SageMath verification.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…