A class of Sudan-decodable codes

Rasmus Refslund Nielsen

    Research output: Contribution to journalJournal articleResearchpeer-review

    509 Downloads (Pure)


    In this article, Sudan's algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-Solomon and Hermitian codes are made.
    Original languageEnglish
    JournalI E E E Transactions on Information Theory
    Issue number4
    Pages (from-to)1564-1572
    Publication statusPublished - 2000

    Bibliographical note

    Copyright: 2000 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

    Fingerprint Dive into the research topics of 'A class of Sudan-decodable codes'. Together they form a unique fingerprint.

    Cite this