Lower Bounds on the Error Probability of Block Codes Based on Improvements on de Caen's Inequality

IEEE Transactions on Information Theory

Volumn 50, Issue 2, 2004, Pages 290-310

  Cohen, Asaf ^a   Merhav, Neri ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Binary symmetric channel (BSC); Error exponent; Gaussian channel; Maximum likelihood decoding; Probability of a union; Probability of error

Indexed keywords

APPROXIMATION THEORY; CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; GAUSSIAN NOISE (ELECTRONIC); MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; PROBABILITY; THEOREM PROVING; WHITE NOISE;

BINARY-SYMMETRIC CHANNEL (BSC); ERROR EXPONENTS; GAUSSIAN CHANNELS; MAXIMUM-LIKELIHOOD DECODING; PROBABILITY OF A UNION; PROBABILITY OF ERROR;

BLOCK CODES;

EID: 1442337676     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.822577     Document Type: Article

References (32)

1. G. Poltyrev, "Bounds on decoding error probability of binary linear codes via their spectra," IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994.
2. R. M. Fano, Transmission of Information. New York: Wiley, 1961.
3. R. G. Gallager, Low Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
4. B. Hughes, "On the error probability of signals in additive white gaussian noise," IEEE Trans. Inform. Theory, vol. 37, pp. 151-155, Jan. 1991.
5. E. R. Berlekamp, "The technology of error correcting codes," Proc. IEEE, vol. 68, pp. 564-593, May 1980.
6. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inform. Theory, vol. IT-11, pp. 3-18, Jan. 1965.
7. C. E. Shannon, "Probability of error for optimal codes in a gaussian channel," Bell Syst. Tech. J, vol. 38, no. 3, pp. 611-656, May 1959.
8. O. Keren and S. Litsyn, "A simple lower bound on the probability of decoding error over a BSC," unpublished notes, 2001.
9. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds to error probability for coding on discrete memoryless channels (Parts I and II)," Inform. Contr, vol. 10, pp. 65-103, 522-552, 1967.
10. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
11. R. J. McEliece and J. K. Omura, "An improved upper bound on the block coding error exponent for bynary-input discrete memoryless channels, " IEEE Trans. Inform. Theory, vol. IT-23, pp. 611-613, Sept. 1977.
12. S. Litsyn, "New upper bounds on error exponents," IEEE Trans. Inform. Theory, vol. 45, pp. 385-398, Mar. 1999.
13. M. V. Burnashev, "On the relation between the code spectrum and the decoding error probability," Probl. Inform. Transm., vol. 36, no. 4, pp. 285-304, 2000.
14. A. Barg and G. D. Forney, "Random codes: Minimum distances and error exponents," IEEE Trans. Inform. Theory, vol. 48, pp. 2568-2573, Sept. 2002.
15. G.E. Seguin, "A lower bound on the error probability for signals in white gaussian noise," IEEE Trans. Inform. Theory, vol. 44, pp. 3168-3175, Nov. 1998.
16. O. Keren and S. Litsyn, "A lower bound on the probability of decoding error over a BSC channel," in Proc. 21st IEEE Electrical and Electronic Engineers in Israel Conf., 2000, pp. 271-273.
17. D. de Caen, "A lower bound on the probability of a union," Discr. Math., vol. 169, pp. 217-220, 1997.
18. H. Kuai and G. T. F. Alajaji, "Tight error bounds for nonuniform signaling over AWGN channels," IEEE Trans. Inform. Theory, vol. 46, pp. 2712-2718, Nov. 2000.
19. H. Kuai, F. Alajaji, and G. Takahara, "A lower bound on the probability of a finite union of events," Discr. Math., vol. 215, pp. 147-158, Mar. 2000.
20. E. G. Kounias, "Bounds on the probability of a union, with applications," Ann. Math. Statist., vol. 39, no. 6, pp. 2154-2158, 1968.
21. D. Hunter, "An upper bound for the probability of a union," J. Appl. Probab., vol. 13, pp. 597-603, 1976.
22. A. Dembo, unpublished notes, communicated by I. Sason, 2000.
23. A. Viterbi and J. Omura, Principles of Digital Communication and Coding. Singapore: McGraw-Hill, 1979.
24. J. Galambos and I. Simonelli, Bonferroni-Type Inequalities with Applications. Berlin, Germany: Springer-Verlag, 1996.
25. R. G. Gallager, "The random coding bound is tight for the average code," IEEE Trans. Inform. Theory, vol. IT-19, pp. 244-246, Mar. 1973.
26. D. P. Bertsekas, Nonlinear Programming, 2 ed. Vienna, VA: Athena Scientific, 1999.
27. A. Cohen, "Lower bounds on the error probability of a given block code," Master's thesis, Technion-Israel Inst. Technol, Haifa, 2002.
28. A. Ashikhmin, A. Barg, and S. Vlǎdut, "Linear codes with exponentialy many light vectors," J. Combin. Theory, vol. A 96, no. 2, pp. 396-399, Nov. 2001.
29. M.-S. Alouini and A. J. Goldsmith, "A unified approach for calculating error rates of linearly modulated signals over generalized fading channels," IEEE Trans. Commun., vol. 47, pp. 1324-1334, Sept. 1999.
30. J. W. Craig, "A new, simple and exact result for calculating the probability of error for two dimentional signal constalletions," in IEEE MILCOM91 Conf. Rec., Boston, MA, 1991, pp. 25.5.1-25.5.5.
31. M. K. Simon and D. Divsalar, "Some new twists to problems involving the Gaussian probability integral," IEEE Trans. Commun., vol. 46, pp. 200-210, Feb. 1998.
32. I. Sason and S. Shamai (Shitz), "Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum," IEEE Trans. Inform. Theory, vol. 46, pp. 24-47, Jan. 2000.