Published September 1986
| Published
Journal Article
Open
On the decoder error probability for Reed-Solomon codes
- Creators
- McEliece, Robert J.
- Swanson, Laif
Abstract
Upper bounds On the decoder error probability for Reed-Solomon codes are derived. By definition, "decoder error" occurs when the decoder finds a codeword other than the transitted codeword; this is in contrast to "decoder failure," which occurs when the decoder fails to find any codeword at all. These results imply, for example, that for a t error-correcting Reed-Solomon code of length q - 1 over GF(q), if more than t errors occur, the probability of decoder error is less than 1/t!.
Additional Information
© 1986 IEEE. Reprinted with permission. Manuscript received October 22, 1985; revised January 3, 1986. Part of this work was presented at the IEEE International Symposium on Information Theory, Brighton, England, June 1985. This work was supported by the National Aeronautics and Space Administration under contract NAS7-918. R.J. McEliece's contribution was also supported by a grant from IBM.Attached Files
Published - MCEieeetit86b.pdf
Files
MCEieeetit86b.pdf
Files
(548.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:33ebcbfed33049510d35bc002d3056cd
|
548.8 kB | Preview Download |
Additional details
- Eprint ID
- 6928
- Resolver ID
- CaltechAUTHORS:MCEieeetit86b
- NAS7-918
- NASA
- IBM
- Created
-
2007-01-03Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field