Isometry-dual flags of AG codes (Q782856)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Isometry-dual flags of AG codes
scientific article

    Statements

    Isometry-dual flags of AG codes (English)
    0 references
    0 references
    0 references
    0 references
    29 July 2020
    0 references
    For a smooth absolutely irreducible projective curve \(X\) of genus \(g\) over a finite field \({\mathbb F}_q\), a set \(P_1,\ldots, P_n\) of distinct \({\mathbb F}_q\)-rational points on \(X\), the divisor \(D=P_1+\cdots+P_n\) and a point \(Q\) not in the support of \(D\), a \textit{one-point Goppa code} \(C_L(D,mQ)\subseteq{\mathbb F}_q^n\) is the image of the evaluation map \[\text{ev}_D:L(G)\rightarrow {\mathbb F}_q^n\] on the Riemann-Roch space \(L(mQ)\) for \(m\) an integer. Now, for \(m_0=-1\) let \(C_0=C_L(D,m_0G)=0\) and for \(1\leq i\leq n\) let \(C_i=C_L(D,m_iQ)\) with the \(m_i\) minimal integers such that \(\dim C_L(D,m_iQ)=i\). Hence, \(m_1=0\) and the nested sequence of codes \[0=C_0\subset C_1\subset \cdots\subset C_n={\mathbb F}_q^n\] is a \textit{complete flag of linear codes}. The integers \(m_i\) are called the \textit{geometric non-gaps} corresponding to \(D\) and \(G\), and for \(m=m_n\) the pair \((n,m)\) is called an \textit{admissible pair}. For a complete flag of one-point Goppa codes over a curve of genus \(g\), the main theorem of the paper under review shows that \(m\leq n+2g-1\) and the admissible pairs are restricted, first to two cases for general complete flags of one-point Goppa codes: \begin{itemize} \item[(a)] \(n=1\) if and only if \(m=0\). \item[(b)] \(\displaystyle n\leq \frac{m}{2}+1\leq g+1\) for \(0<m\leq 2g\). \end{itemize} And then to two cases for isometry-dual complete flags of one-point Goppa codes: \begin{itemize} \item[(c)] \(\displaystyle n\leq \frac{m}{2}+\frac{3}{2}< 2g+2\) for \(2g<m\leq 4g\). \item[(d)] \( n=m+1-2g\geq 2g+2\) for \(m>4g\). \end{itemize} There is a converse property: A complete flag of one-point Goppa codes with \(n=m+1-2g\geq 2g+2\) is isometry-dual. The first two cases are proved using the Riemann-Roch and Clifford theorems and the remaining two cases are proved via a generalization of Proposition 4.3 of \textit{O. Geil} et al. [Adv. Math. Commun. 5, No. 3, 489--504 (2011; Zbl 1239.94084)] originally proved for \(n>2g+2\) and showing that indeed holds for \(n\geq 2g+2\). Moreover, the authors construct an example using a Hermitian curve over \({\mathbb F}_4\) that shows that the weaker condition is best possible. Additionally, the authors prove that given an isometry-dual complete flag of one-point Goppa codes, the flag of punctured one-point Goppa codes is also isometry-dual if the number of punctured coordinates is a Weierstrass non-gap of the curve \(X\) at the point \(Q\). Moreover, there is also a characterization, in terms of maximum sparse ideals of the Weierstrass semigroup of \(X\) at \(Q\), for a flag of punctured one-point Goppa codes to inherit the isometry-dual property from the original flag.
    0 references
    Goppa codes
    0 references
    complete flag of codes
    0 references
    punctured code
    0 references
    dual code
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references