On the minimum distance of AG codes, on Weierstrass semigroups and the smoothability of certain monomial curves in 4-Space

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

30 pages, presented at CAAG 2010 (Bangalore, India)

Scientific paper

In this paper we treat several topics regarding numerical Weierstrass semigroups and the theory of Algebraic Geometric Codes associated to a pair $(X, P)$, where $X$ is a projective curve defined over the algebraic closure of the finite field $F_q$ and P is a $F_q$-rational point of $X$. First we show how to evaluate the Feng-Rao Order Bound, which is a good estimation for the minimum distance of such codes. This bound is related to the classical Weierstrass semigroup of the curve $X$ at $P$. Further we focus our attention on the question to recognize the Weierstrass semigroups over fields of characteristic 0. After surveying the main tools (deformations and smoothability of monomial curves) we prove that the semigroups of embedding dimension four generated by an arithmetic sequence are Weierstrass.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the minimum distance of AG codes, on Weierstrass semigroups and the smoothability of certain monomial curves in 4-Space does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the minimum distance of AG codes, on Weierstrass semigroups and the smoothability of certain monomial curves in 4-Space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the minimum distance of AG codes, on Weierstrass semigroups and the smoothability of certain monomial curves in 4-Space will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-450228

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.