We decode Reed-Solomon codes using soft information provided at the receiver. The Extended Euclidean Algorithm (EEA) is considered as an initial step to obtain an intermediate result. The final decoding result is obtained by interpolating the output of the EEA at the least reliable positions of the received word.We refer to this decoding method as reduced list-decoding, since not all received positions are used in the interpolation as in other list-decoding methods, such as the Guruswami-Sudan and Wu algorithms. Consequently the complexity of the interpolation step is reduced considerably. The probability of failure can be minimised by adjusting certain parameters, making it comparable with the Kötter-Vardy algorithm but having a much lower complexity.
|Number of pages||7|
|Publication status||Published - 2014|
|Event||21st International Symposium on Mathematical Theory of Networks and Systems (MTNS 2014) - Groningen, Netherlands|
Duration: 7 Jul 2014 → 11 Jul 2014
Conference number: 21
|Conference||21st International Symposium on Mathematical Theory of Networks and Systems (MTNS 2014)|
|Period||07/07/2014 → 11/07/2014|