Abstract
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.
Original language | English |
---|---|
Title of host publication | WCC 2013 International Workshop on Coding and Cryptography |
Number of pages | 11 |
Publication date | 2013 |
Publication status | Published - 2013 |
Event | International Workshop on Coding and Cryptography (WCC 2013) - Bergen, Norway Duration: 15 Apr 2013 → 19 Apr 2013 http://www.selmer.uib.no/WCC2013/ |
Conference
Conference | International Workshop on Coding and Cryptography (WCC 2013) |
---|---|
Country/Territory | Norway |
City | Bergen |
Period | 15/04/2013 → 19/04/2013 |
Internet address |
Keywords
- Guruswami–Sudan
- List Decoding
- Reed–Solomon Codes
- Multi-Trial