Hermitian codes and complete intersections (Q2302573)

Let \(\mathcal{H}\) be the Hermitian curve \(y^q+y=x^{q+1}\) plus a point at \(\infty\) over the field \(\mathbb {F}_{q^2}\). An Hermitian code is an \([n,k,d]\) one-point code in which the vector space is \(H^0(\mathcal {O}_{\mathcal {H}}(t\infty))\) for some \(t\). Here \(n =q^3\). All the minimum distance \(d\) of such codes are known in terms of \(t\). They depends on the \(t\) and \(q\). In a certain region of the plane \((q,t)\) the authors in [J. Pure Appl. Algebra 223, No. 9, 3843--3858 (2019; Zbl 1436.11070)] proved that the support of the minimum weight or low weight codewords are certain complete intersections of \(\mathcal {H}\) with a certain very low degree curve. Here the authors (in the region \(d\geq q^2-q\)) give a similar result in another region of \((t,q)\), but with a more explicit way to obtain them the precise minimum weight codewords (giving algorithms in Magma). Write \(d =\mu q +\lambda (q+1)\) with \(\mu \le q\). they prove that a zero-dimensional scheme \(Z\subset {\mathbb {F}_{q^2}}^2\) is the support of a minimum-weight codewors if and only if it is formed by \(d\) distinct points and it is the complete intersection (outside \(\infty\)) of \(\mathcal {H}\) with a curve \(X\) of degree \(\lambda +\mu\) whose equation has \(x^\mu y^\lambda\) as leading term with respect to DegRevLex with \(y>x\).