Performance analysis of a decoding algorithm for algebraic-geometry codes

Tom Høholdt, Helge Elbrønd Jensen, Rasmus Refslund Nielsen

    Research output: Contribution to journalJournal articleResearchpeer-review


    The fast decoding algorithm for one point algebraic-geometry codes of Sakata, Elbrond Jensen, and Hoholdt corrects all error patterns of weight less than half the Feng-Rao minimum distance. In this correspondence we analyze the performance of the algorithm for heavier error patterns. It turns out that in the typical case, where the error points are "independent," one can prove that the algorithm always fails, that is gives a wrong or no answer, except for high rates where it does much better than expected. This explains the simulation results presented by O'Sullivan at the 1997 ISIT, We also show that for dependent errors the algorithm almost always corrects these.
    Original languageEnglish
    JournalI E E E Transactions on Information Theory
    Issue number5
    Pages (from-to)1712-1717
    Publication statusPublished - 1999
    EventIEEE-ISIT 1998 - Boston, Mass., USA
    Duration: 1 Jan 1998 → …


    ConferenceIEEE-ISIT 1998
    CityBoston, Mass., USA
    Period01/01/1998 → …


    • Algebraic-geometry codes
    • Decoding
    • Performance assessment


    Dive into the research topics of 'Performance analysis of a decoding algorithm for algebraic-geometry codes'. Together they form a unique fingerprint.

    Cite this