Lower bounds on the error probability of block codes based on improvements on de Caen's inequality

New lower bounds on the error probability of block codes with maximum-likelihood decoding are proposed. The bounds are obtained by applying a new lower bound on the probability of a union of events, derived by improving on de Caen's lower bound. The new bound includes an arbitrary function to be optimized in order to achieve the tightest results. Since the optimal choice of this function is known, but leads to a trivial and useless identity, we find several useful approximations for it, each resulting in a new lower bound. For the additive white Gaussian noise (AWGN) channel and the binary-symmetric channel (BSC), the optimal choice of the optimization function is stated and several approximations are proposed. When the bounds are further specialized to linear codes, the only knowledge on the code used is its weight enumeration. The results are shown to be tighter than the latest bounds in the current literature, such as those by Seguin (1998) and by Keren and Litsyn (2001). Moreover, for the BSC, the new bounds widen the range of rates for which the union bound analysis applies, thus improving on the bound to the error exponent compared with the de Caen-based bounds.

[1]  Dominique de Caen,et al.  A lower bound on the probability of a union , 1997, Discret. Math..

[2]  Fady Alajaji,et al.  A lower bound on the probability of a finite union of events , 2000, Discret. Math..

[3]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[4]  J. Galambos,et al.  Bonferroni-type inequalities with applications , 1996 .

[5]  Fady Alajaji,et al.  Tight error bounds for nonuniform signaling over AWGN channels , 2000, IEEE Trans. Inf. Theory.

[6]  Robert G. Gallager,et al.  The random coding bound is tight for the average code (Corresp.) , 1973, IEEE Trans. Inf. Theory.

[7]  Elwyn R. Berlekamp,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..

[8]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[9]  Amiel Feinstein,et al.  Transmission of Information. , 1962 .

[10]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[11]  J. Craig.  A new, simple and exact result for calculating the probability of error for two-dimensional signal constellations , 1991, MILCOM 91 - Conference record.

[12]  David J. Hunter.  An upper bound for the probability of a union , 1976, Journal of Applied Probability.

[13]  C. Shannon.  Probability of error for optimal codes in a Gaussian channel , 1959 .

[14]  Alexander Barg,et al.  Linear Codes with Exponentially Many Light Vectors , 2001, J. Comb. Theory, Ser. A.

[15]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[16]  E. Kounias.  Bounds for the Probability of a Union, with Applications , 1968 .

[17]  József Bukszár.  Quickly computable bounds on the probability of a union , 2002 .

[18]  Osnat Keren,et al.  A lower bound on the probability of decoding error over a BSC channel , 2000, 21st IEEE Convention of the Electrical and Electronic Engineers in Israel. Proceedings (Cat. No.00EX377).

[19]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[20]  Alexander Barg,et al.  Random codes: Minimum distances and error exponents , 2002, IEEE Trans. Inf. Theory.

[21]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[22]  Dariush Divsalar,et al.  Some new twists to problems involving the Gaussian probability integral , 1998, IEEE Trans. Commun..

[23]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[24]  Mill Johannes G.A. Van,et al.  Transmission Of Information , 1961 .

[25]  Simon Litsyn,et al.  New Upper Bounds on Error Exponents , 1999, IEEE Trans. Inf. Theory.

[26]  Shlomo Shamai,et al.  Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum , 2000, IEEE Trans. Inf. Theory.

[27]  Gérald E. Séguin.  A Lower Bound on the Error Probability for Signals in White Gaussian Noise , 1998, IEEE Trans. Inf. Theory.

[28]  A. Goldsmith,et al.  A unified approach for calculating error rates of linearly modulated signals over generalized fading channels , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[29]  Robert J. McEliece,et al.  An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.) , 1977, IEEE Trans. Inf. Theory.

[30]  Neri Merhav,et al.  New lower bounds on the error probability of a given block code , 2002, The 22nd Convention on Electrical and Electronics Engineers in Israel, 2002..

[31]  Brian L. Hughes,et al.  On the error probability of signals in additive white Gaussian noise , 1991, IEEE Trans. Inf. Theory.