Performance Analysis of a Decoding Algorithm for Algebraic Geometry Codes

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

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

    317 Downloads (Pure)

    Abstract

    We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance
    Original languageEnglish
    Title of host publicationInformation Theory, 1998. Proceedings. 1998 IEEE International Symposium on
    Number of pages378
    Place of PublicationNew York
    PublisherIEEE
    Publication date1998
    ISBN (Print)0-7803-5000-6
    DOIs
    Publication statusPublished - 1998
    EventIEEE Inretnational Symposium on Information Theory - Boston , Mass. USA
    Duration: 1 Jan 1998 → …

    Conference

    ConferenceIEEE Inretnational Symposium on Information Theory
    CityBoston , Mass. USA
    Period01/01/1998 → …

    Bibliographical note

    Copyright: 1998 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

    Cite this

    Jensen, H. E., Nielsen, R. R., & Høholdt, T. (1998). Performance Analysis of a Decoding Algorithm for Algebraic Geometry Codes. In Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on IEEE. https://doi.org/10.1109/ISIT.1998.708983