Heng's NMDS code conjecture for the extended trace code

Let qq be a prime power, let

μq+1={xFq2:xq+1=1},D=μq+1{1},\mu_{q+1}=\{x\in \mathbb{F}_{q^2}:x^{q+1}=1\},\qquad D=\mu_{q+1}\setminus\{-1\},

and let Trqq2:Fq2Fq\operatorname{Tr}^{q^2}_q:\mathbb{F}_{q^2}\to\mathbb{F}_q be the trace map, Trqq2(x)=x+xq\operatorname{Tr}^{q^2}_q(x)=x+x^q. For bFq2b\in\mathbb{F}_{q^2} and cFqc\in\mathbb{F}_q, define

c(b,c)=((Trqq2(bx+b)+c)xD,Trqq2(b)),c(b,c)=\bigl((\operatorname{Tr}^{q^2}_q(bx+b)+c)_{x\in D},-\operatorname{Tr}^{q^2}_q(b)\bigr),

and set

CD~={c(b,c):bFq2, cFq}.\widetilde{\overline{C_D}}=\{c(b,c):b\in\mathbb{F}_{q^2},\ c\in\mathbb{F}_q\}.

Heng's conjecture. If q>2q>2, then CD~\widetilde{\overline{C_D}} is a [q+1,3,q2]q[q+1,3,q-2]_q NMDS code. This conjecture concerns the remaining family of NMDS codes identified by Heng; proving it establishes the asserted parameters and the NMDS property for this extended trace construction.

Sources & referencesView supporting material

Primary source

Wei Lu and Xia Wu, “A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes”, arXiv:2304.04176 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.