The undetected error probability for Reed-Solomon codesMcEliece and Swanson (1986) offered an upper bound on P(E)u, the decoder error probability given u symbol errors occur. In the present study, by using a combinatoric technique such as the principle of inclusion and exclusion, an exact formula for P(E)u is derived. The P(E)u of a maximum distance separable code is observed to approach Q rapidly as u gets large, where Q is the probability that a completely random error pattern will cause decoder error. An upper bound for the expansion 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 that some laws of large number come into play.
Document ID
19890036661
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Cheung, Kar-Ming (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Mceliece, Robert J. (California Institute of Technology Jet Propulsion Laboratory, Pasadena, United States)
Date Acquired
August 14, 2013
Publication Date
January 1, 1988
Subject Category
Communications And Radar
Meeting Information
Meeting: MILCOM ''88 - IEEE Military Communications Conference