Key-equations for list decoding of Reed-Solomon codes and how to solve them

Peter Beelen, Kristian Brander

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    A Reed-Solomon code of length n can be list decoded using the well-known Guruswami-Sudan algorithm. By a result of Alekhnovich (2005) the interpolation part in this algorithm can be done in complexity O(s^4l^4nlog^2nloglogn), where l denotes the designed list size and s the multiplicity parameter. The parameters l and s are sometimes considered to be constants in the complexity analysis, but for high rate Reed-Solomon codes, their values can be very large. In this paper we will combine ideas from Alekhnovich (2005) and the concept of key equations to get an algorithm that has complexity O(sl^4nlog^2nloglogn). This compares favorably to the complexities of other known interpolation algorithms.
    Original languageEnglish
    JournalJournal of Symbolic Computation
    Volume45
    Issue number7
    Pages (from-to)773-786
    ISSN0747-7171
    DOIs
    Publication statusPublished - 2010

    Fingerprint Dive into the research topics of 'Key-equations for list decoding of Reed-Solomon codes and how to solve them'. Together they form a unique fingerprint.

    Cite this