In this talk we use techniques from coding theory to derive
upper bounds for the number of rational places of an algebraic curve
defined over a finite field. The used techniques yield upper bounds if the
(generalized) Weierstrass semigroup for an n‐tuple of places is known.
This sometimes enables one to get an upper bound for the number of
rational places for families of function fields. We consider an application
to toric codes.