CEU Electronic Theses and Dissertations, 2019
| Author | Keita, Amadou |
|---|---|
| Title | Improved Complexity in Decoding Reed-Solomon Codes |
| Summary | The Guruswami-Sudan algorithm is a standard algorithm that decodes beyond the classical decoding bound for Reed-Solomon codes. We study some complexity improvement techniques namely polynomial reconstruction and basis transformation which enhance the decoding capabilities of the algorithm, and compare the techniques. |
| Supervisor | Hegedus, Pal |
| Department | Mathematics MSc |
| Full text | https://www.etd.ceu.edu/2019/keita_amadou.pdf |
Visit the CEU Library.
© 2007-2021, Central European University