On the Decoder Error Probability for Reed-Solomon Codes

IEEE Transactions on Information Theory

Volumn 32, Issue 5, 1986, Pages 701-703

  McEliece, Robert J ^a   Swanson, Laif ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - COMMUNICATION CHANNELS; PROBABILITY;

DECODER ERROR PROBABILITY; REED-SOLOMON CODING; T-ERROR-CORRECTING REED-SOLOMON CODE;

CODES, SYMBOLIC;

EID: 0022779449     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1986.1057212     Document Type: Article

References (4)

1. E. R. Berlekamp and J. L. Ramsey, “Readable erasures improve the performance of Reed-Solomon codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 632–633, Sep. 1978.
2. T. Kasami and S. Lin, “On the probability of undetected error for the maximum distance separable codes,” IEEE Trans. Comm., vol. COM-32, pp. 998–1006, Sep. 1984.
3. D. E. Knuth, The Art of Computer Programming, vol. 1, Fundamental Algorithms. Reading, MA: Addison-Wesley, 1968.
4. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.