Toggle Main Menu Toggle Search

Open Access padlockePrints

Decoding Reed-Solomon codes using the Guruswami-Sudan algorithm

Lookup NU author(s): Dr Li Chen


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


List decoding algorithms improve the error-correction performance of a code by generating a list of possible transmitted messages instead of one unique message as with conventional algebraic decoders, making it possible to correct errors beyond half the hamming distance boundary d/2. In this paper, we present new simulation results for Reed-Solomon (RS) codes using the Guruswami-Sudan (GS) list decoding algorithm over the AWGN and Rayleigh fading channels. The results show significant coding gains over the unique decoding algorithm can be achieved for low rate codes and over fading channels. A complexity analysis of GS algorithm is presented and comparisons are made with the unique decoding algorithm. We conclude that although coding gains can be achieved, it is at the expense of high complexity.

Publication metadata

Author(s): Chen L

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Fifth International Conference on Communication Systems, Networks and Digital Signal Processing, CSNDSP 2006

Year of Conference: 2006

Publisher: University of Patras and CSNDSP, School of CEIS, Northumbria University, Newcastle upon Tyne


Library holdings: Search Newcastle University Library for this item

ISBN: 9608928206