Algebraic soft-decoding of Reed-Solomon codes

Since there is no site dedicaced to publishing (master) thesis works and other scientific contribution, here it is. It explains the recent algorithm developped by Sudan, Guruswami as well as the enchancement from Koetter, Vardy to provide soft-decoding. I.e, decoding by taking advantage of the likelyhood of each symbol. This results in better decoding performances than classical Reed-Solomon decoding techniques for any code rate.

The thesis is a homogenous explanation of the whole algorithm, explaining everything from the ground up. There is an emphasis on pedagogical approach and a reader should be able to understand completely the algorithm and to program their own RS soft-decoder by reading it. Each chapter is accompagned by examples to consolidate and facilitate your understanding. Along with this thesis comes a C# implementation (which focuses on source code clarity) .

Download thesis (pdf)

Advertisements

Tags: , , , , , , , ,

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


%d bloggers like this: