Goppa codes and Weierstrass gaps

From MaRDI portal





[For the entire collection see Zbl 0745.00062.] V. D. Goppa realized that one can use divisor theory on a curve over a finite field to define nice codes \(C(D,G)\) and \(C^*(D,G)\) with good lower bounds for the minimum distance. In this work, we improve the bound on the minimum distance of the code \(C^*(D,G)\), when the divisor \(G\) has the form \(G=(a+b-1)P+2B\) with \(a\) and \(b\) being \(B\)-Weierstrass gaps at a fixed rational point \(P\) on the curve. In the case of consecutive \(B\)-Weierstrass gaps at the point \(P\), assuming certain properties of the osculating spaces to the curve at \(P\), we achieve a significant improvement of Goppa's lower bound. We remark that in Theorem (2.8) one should add the assumption that each rational divisor of degree \(t\) spans a \((t-1)\)-plane.











This page was built for publication: Goppa codes and Weierstrass gaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027638)