Loading...
Please wait, while we are loading the content...
Similar Documents
The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes
| Content Provider | Semantic Scholar |
|---|---|
| Author | McEliece, Robert J. |
| Copyright Year | 2003 |
| Abstract | This article is a tutorial discussion of the Guruswami-Sudan (GS) Reed-Solomon decoding algorithm, including self-contained treatments of the Kotter and Roth- Ruckenstein (RR) improvements. It also contains a number of new results, including a rigorous discussion of the average size of the decoder's list, an improvement in the RR algorithm's stopping rule, a simplified treatment of the combinatorics of weighted monomial orders, and a proof of the monotonicity of the GS decoding radius as a function of the interpolation multiplicity. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://ipnpr.jpl.nasa.gov/progress_report/42-153/153F.pdf |
| Alternate Webpage(s) | http://tmo.jpl.nasa.gov/progress_report/42-153/153F.pdf |
| Alternate Webpage(s) | https://ipnpr.jpl.nasa.gov/progress_report/42-153/153F.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
