The order bound for general algebraic geometric codes (Q2370649): Difference between revisions

Let \(C_{\mathcal{P}}(G)\) be the dual code of the evaluation code \(E_{\mathcal{P}}(G)\), associated to divisors \(\mathcal{P}\) and \(G\) on an algebraic curve \(\mathcal{C}\) of genus \(g\) defined over a finite field \(F_q\). The Goppa bound \(\deg G-2g+2\), gives a lower bound for the minimum distance of the code \(C_{\mathcal{P}}(G)\) and other results as the Kirfel-Pellikaan bound [\textit{C. Kirfel} and \textit{R. Pellikaan}, IEEE Trans. Inf. Theory 41, 1720--1732 (1995; Zbl 0860.94031)] or the generalized floor bound [\textit{B. Lundell} and \textit{J. McCullough}, J. Pure Appl. Algebra 207, No. 1, 155--164 (2006; Zbl 1102.94030)] improve it. In the particular case \(G=mQ\), i.e. for one-point algebraic geometric codes another bound is provided by the well-known order bound [\textit{V. S. Pless} and \textit{W. C. Huffman} (eds.), Handbook of Coding Theory, vol. 1, Chapter 10 (1998; Zbl 0907.94001)]. In the present paper the author gives a generalization of the order bound to the case of an arbitrary (rational and with support disjoint from \(\mathcal{P}\)) divisor \(G\). Section 2 of the paper introduces and proves the generalized order bound. The author points out that, in the one-point case, this bound can be better than the ordinary order bound and he illustrates it with the example of codes coming from the Klein quartic. In particular he shows that for the code \(C_\mathcal{P}(5P)\), where \(P=(O:O:1)\) and \(\mathcal{P}\) the set of all points different from \((0:0:1), (0:1:0)\) and \((1:0:0)\), the ordinary lower bound is 2 while the generalized bound equals the minimal distance 3 of the code. Section 3 compares the generalized order bound with the Goppa bound, the Kirfel-Pellikaan bound and the generalized floor bound. In particular the generalized order bound is compared with the generalized floor bound for two-points codes coming from the Suzuki curve (a genus 14 curve over \(F_8\) with 65 rational points). Finally Section 4 studies two-points codes coming from the Hermite curve (curve over \(F_{q^2}\) with \(q^3+1\) rational points, attaining the Hasse-Weil bound). Then the author uses the generalized order bound to find a lower bound on the minimum distance of those codes, bound that ``in fact gives the exact minimum distance in a large range''.