Beta 1


Title List decoding of Error-Correcting Codes
Author Nielsen, Johan Sebastian Rosenkilde (Discrete mathematics, Department of Mathematics, Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark)
Supervisor Høholdt, Tom (Discrete mathematics, Department of Mathematics, Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark)
Beelen, Peter (Discrete mathematics, Department of Mathematics, Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark)
Institution Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark
Thesis level Master's thesis
Year 2010
Abstract Recently, Wu proposed in [24] a new approach to list decoding Reed-Solomon codes, quite dierent from the Guruswami-Sudan algorithm and its derivatives [1,2,10,18]. It promises lower running-time and has shown new perspectives of the codes. Sadly, the impact of this idea has hitherto been minimal; the contribution is indisputable, so the reason might be found in the idea's sole exposition: a convoluted article, presenting and proving a long range of intricate results on a strict page limit. In this thesis, we give a complete, self-contained and novel presentation of Wu's decoding algorithm. The key mechanics of the algorithm build on a combination of several previous decoders, and we begin with a full presentation of these and their background theory. We then derive Wu's algorithm itself, with a clear division between the results in general algebraic theory, and the application of these on the decoding problem.
Pages 86
Fulltext
Original PDF thesis_1.pdf (0.44 MB)
Admin Creation date: 2011-02-23    Update date: 2011-02-28    Source: dtu    ID: 275143    Original MXD