On the order bounds for one-point AG codes (Q644324): Difference between revisions

Let \(\mathcal{X}\) be a curve over a finite field, \(D=P_1+\ldots+P_n\) be a rational effective divisor and \(Q\) be a rational point not in the support of \(D\). The Goppa code \(C(D,mQ)\) obtained by evaluation of the functions of the Rieman-Roch space \(\mathcal{L}(mQ)\) at the points \(P_1,\dots,P_n\) is called a one-point AG code. \textit{H. E. Andersen} and \textit{O. Geil} [``Evaluation codes from order domain theory'', Finite Fields Appl. 14, No. 1, 92--123 (2008; Zbl 1136.94010)] introduced an order-type bound \(d^*\) for the minimum distance of general linear codes. This means that \(d^*\) takes the minimum value of a family of bounds for different subsets of codewords, and it is succesful if the estimates for each subset are better than a uniform bound for all codewords. Order-type bounds for particular classes of codes have been introduced by \textit{G.-L. Feng} and \textit{T. R. N. Rao} [``Improved geometric Goppa codes. I: Basic theory'', IEEE Trans. Inf. Theory 41, No. 6, Pt. 1, 1678--1693 (1995; Zbl 0866.94025)], and then generalized by \textit{P. Beelen} [``The order bound for general algebraic geometric codes'', Finite Fields Appl. 13, No. 3, 665--680 (2007; Zbl 1118.94012)] and other authors. The aim of the present paper is to review the definition of \(d^*\) for one-point AG codes and to relate it to the other constructions of order-type bounds. The paper emphasizes the possibility to manage the order-type bounds entirely in the language of one-point AG codes and Weierstrass semigroups. Also, \(d^*\) is used to construct improved codes, and its definition is extended to all generalized Hamming weights.