A Caltech Library Service

On the decoder error probability for Reed-Solomon codes

McEliece, Robert J. and Swanson, Laif (1986) On the decoder error probability for Reed-Solomon codes. IEEE Transactions on Information Theory, 32 (5). pp. 701-703. ISSN 0018-9448. doi:10.1109/TIT.1986.1057212.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


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!.

Item Type:Article
Related URLs:
URLURL TypeDescription
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.
Funding AgencyGrant Number
Issue or Number:5
Record Number:CaltechAUTHORS:MCEieeetit86b
Persistent URL:
Official Citation:R. McEliece and L. Swanson, "On the decoder error probability for Reed - Solomon codes (Corresp.)," in IEEE Transactions on Information Theory, vol. 32, no. 5, pp. 701-703, September 1986. doi: 10.1109/TIT.1986.1057212
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:6928
Deposited By: Archive Administrator
Deposited On:03 Jan 2007
Last Modified:08 Nov 2021 20:38

Repository Staff Only: item control page