Efficient factorisation algorithm for list decoding algebraic-geometric and Reed-Solomon codes

  1. Lookup NU author(s)
  2. Dr Li Chen
  3. Emeritus Professor Rolando Carrasco
  4. Dr Martin Johnston
  5. Dr Graeme Chester
Author(s)Chen L, Carrasco RA, Johnston M, Chester EG
Publication type Conference Proceedings (inc. Abstract)
Conference NameInternational Conference on Communications
Conference LocationGlasgow, UK
Year of Conference2007
Source Publication Date24-28 June 2007
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm for Algebraic-Geometric (AG) codes and Reed-Solomon (RS) codes has been developed by Guruswami and Sudan, called the Guruswami-Sudan (GS) algorithm. The algorithm includes two steps: Interpolation and Factorisation. To implement interpolation, Koetter proposed an iterative polynomial construction algorithm for RS codes. By redefining a polynomial over algebraic function fields, Koetter’s algorithm can also be applied to AG codes. To implement factorisation, Roth and Ruckenstein proposed an efficient algorithm for RS codes and later Wu and Siegel extended it to AG codes. Following on from their previous work, we propose a more general factorisation algorithm which can be applied to both AG and RS codes. This algorithm avoids rational function quotient calculations required by Wu and Siegel’s algorithm, making it more efficient to implement. As well as employing this algorithm to list decode AG and RS codes this paper also presents the first simulation results evaluating the list decoding performance comparison between AG and RS codes of a similar code rate defined over the same finite field.
ActionsLink to this publication
Library holdingsSearch Newcastle University Library for this item