An iterated refinement procedure for the Guruswami–Sudan list decoding algorithm for Generalised Reed–Solomon codes based on Alekhnovich’s module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list of closest codewords within an intermediate radius can be performed with improved average-case complexity while retaining the worst-case complexity.
Wcc 2013 International Workshop on Coding and Cryptography, 2013
Guruswami–Sudan; List Decoding; Reed–Solomon Codes; Multi-Trial
Main Research Area:
International Workshop on Coding and Cryptography (WCC 2013)Workshop on Coding and Cryptography