Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 1988 | Published
Book Section - Chapter Open

The undetected error probability for Reed-Solomon codes

Abstract

This paper is an extension of a recent paper by McEliece and Swanson dealing with the decoder error probability for Reed-Solomon codes {more generally, linear MDS codes). McEliece and Swanson offered an upper bound on P_E(u), the decoder error probability given u symbol errors occur. In this paper, by using combinatoric technique like the principle of inclusion and exclusion, an exact formula for P_E(u) is derived. The P_E(u) of an MDS code is observed to approach Q rapidly as u gets large, where Q is the probability that a compltely random error pattern will cause decoder error. An upper bound for the expression │P_E(u)/Q-1│ is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P_E(u) indeed approaches Q as u becomes large, and some laws of large number come info play somehow.

Additional Information

© 1988 IEEE. Date of Current Version: 06 August 2002. This work was supported in part by the National Aeronautics and Space Administration under Grant NAS7-918 and in part by the Air Force Office of Scientific Research Grant AFOSR-83-0296.

Attached Files

Published - CHEmilcom95.pdf

Files

CHEmilcom95.pdf
Files (244.4 kB)
Name Size Download all
md5:d3c38e002be6dedc58735aa45764cb40
244.4 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023