On the Geil–Matsumoto bound and the length of AG codes
- 169 Downloads
The Geil–Matsumoto bound conditions the number of rational places of a function field in terms of the Weierstrass semigroup of any of the places. Lewittes’ bound preceded the Geil–Matsumoto bound and it only considers the smallest generator of the numerical semigroup. It can be derived from the Geil–Matsumoto bound and so it is weaker. However, for general semigroups the Geil–Matsumoto bound does not have a closed formula and it may be hard to compute, while Lewittes’ bound is very simple. We give a closed formula for the Geil–Matsumoto bound for the case when the Weierstrass semigroup has two generators. We first find a solution to the membership problem for semigroups generated by two integers and then apply it to find the above formula. We also study the semigroups for which Lewittes’s bound and the Geil–Matsumoto bound coincide. We finally investigate on some simplifications for the computation of the Geil–Matsumoto bound.
KeywordsAlgebraic function field Weierstrass semigroup Geil–Matsumoto bound Gonality bound Lewittes’ bound
Mathematics Subject Classification14Q05 11G20 68R01
Unable to display preview. Download preview PDF.
- 1.Beelen P., Ruano D.: Bounding the number of points on a curve using a generalization of Weierstrass semigroup. Des. Codes Cryptogr. (2012) (Accepted).Google Scholar
- 5.Høholdt T., van Lint J.H., Pellikaan R.: Algebraic geometry codes. In: Handbook of Coding Theory, vol. I, II, pp. 871–961. North-Holland, Amsterdam (1998).Google Scholar
- 6.Kirfel C., Pellikaan R.: The minimum distance of codes in an array coming from telescopic semigroups. IEEE Trans. Inform. Theory 41(6 part 1), 1720–1732 (1995) (Special issue on algebraic geometry codes).Google Scholar
- 8.Rosales J.C., García-Sánchez P.A.: Numerical semigroups. In: Developments in Mathematics, vol. 20. Springer, New York (2009).Google Scholar