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 http://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86b
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 535Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86b
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!.
| Item Type: | Article |
|---|---|
| Additional Information: | © Copyright 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. |
| Record Number: | CaltechAUTHORS:MCEieeetit86b |
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86b |
| Alternative URL: | http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=22756&arnumber=1057212&count=18&index=0 |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 6928 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Archive Administrator |
| Deposited On: | 03 Jan 2007 |
| Last Modified: | 26 Dec 2012 09:26 |
Repository Staff Only: item control page
