Decoding Hermitian Codes with Sudan's Algorithm

Tom Høholdt, Rasmus Refslund Nielsen

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    Abstract

    We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q-polynomial, and a reduction of the problem of factoring the Q-polynomial to the problem of factoring a univariate polynomial over a large finite field.
    Original languageEnglish
    Title of host publication Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings
    Place of PublicationBerlin
    PublisherSpringer
    Publication date1999
    Pages260-270
    ISBN (Print)3-540-66723-7
    DOIs
    Publication statusPublished - 1999
    EventInternational Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - Honolulu, United States
    Duration: 15 Nov 199919 Nov 1999
    Conference number: 13

    Conference

    ConferenceInternational Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
    Number13
    CountryUnited States
    CityHonolulu
    Period15/11/199919/11/1999
    SeriesLecture Notes in Computer Science
    Volume1719
    ISSN0302-9743

    Fingerprint

    Dive into the research topics of 'Decoding Hermitian Codes with Sudan's Algorithm'. Together they form a unique fingerprint.

    Cite this