Lower bounds for the minimum distance of algebraic geometry codes

Peter Beelen (Invited author)

    Research output: Contribution to conferenceConference abstract for conferenceResearch


    A one-point AG-code is an algebraic geometry code based on a divisor whose support consists of one point. Since the discovery of the Feng-Rao lower bound for the minimum distance, there has been a renewed interest in such codes. This lower bound is also called the order bound. An alternative description of these codes in terms of order domains has been found. In my talk I will indicate how one can use the ideas behind the order bound to obtain a lower bound for the minimum distance of any AG-code. After this I will compare this generalized order bound with other known lower bounds, such as the Goppa bound, the Feng-Rao bound and the Kirfel-Pellikaan bound. I will finish my talk by giving several examples. Especially for two-point codes, the generalized order bound is fairly easy to compute. As an illustration, I will indicate how a lower bound can be obtained for the minimum distance of some two-point codes coming from the Hermitian curve and compare the outcome with some recent results of Kim and Homma.
    Original languageEnglish
    Publication date2005
    Publication statusPublished - 2005
    EventAlgebraic Geometry and Coding Theory-10 - Luminy, Marseille, Frankrig
    Duration: 1 Jan 2005 → …


    ConferenceAlgebraic Geometry and Coding Theory-10
    CityLuminy, Marseille, Frankrig
    Period01/01/2005 → …


    Dive into the research topics of 'Lower bounds for the minimum distance of algebraic geometry codes'. Together they form a unique fingerprint.

    Cite this