New upper bounds on error exponents

IEEE Transactions on Information Theory

Volumn 45, Issue 2, 1999, Pages 385-398

  Litsyn, Simon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Distance distribution; Error exponents; Krawtchouk polynomials; Maximum likelihood decoding; Undetected error

Indexed keywords

CODES (SYMBOLS); DECODING; ERROR DETECTION; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIALS; PROBABILITY;

BINARY SYMMETRIC CHANNELS (BSC); DISTANCE DISTRIBUTIONS; MAXIMUM LIKELIHOOD DECODING;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0033101142     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.748991     Document Type: Article

References (55)

1. K.A. S. Abdel-Ghaffar, "A lower bound on the undetected error probability and strictly optimal codes," IEEE Trans. Inform. Theory, vol. 43, pp. 1489-1502, Sept. 1997.
2. A. Barg, "Binomial moments of distance distribution and the probability of undetected error," perprint, 1997.
3. L.A. Bassalygo, "New upper bounds for codes correcting errors," Probl. Pered. Inform., vol. 1, no. 4, pp. 4144, 1965.
4. R.E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
5. V.M. Blinovskii, "An estimate for the probability of undetected error," Probl. Pered. Inform., vol. 32, no. 2, pp. 3-9, 1996.
6. E.L. Blokh and V. V. Zyablov, Linear Concatenated Codes. Moscow, USSR: Nauka, 1982 (in Russian).
7. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes. Amsterdam, The Netherlands: Elsevier, 1997.
8. I. Csisziâr and J. Körner, Information Theory. Coding Theorems for Discrete Memoryless Systems. Budapest, Hungary: Akademiai Kiado, 1981.
9. P. Delsarte, An Algebraic Approach to the Association Schemes of Coding Theory (Philips Res. Rep. Suppi, no. 10), 1973.
10. P. Elias, "Coding for two noisy channels," in Information Theory. New York: Academic, 1956, pp. 61-74.
11. R.M. Fano, Transmission of Information. Boston, MA: MIT Press, 1961.
12. R.G. Gallager, Low-Density Parity-Check Codes. Boston, MA: MIT Press, 1963.
13. R.G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inform. Theory, vol. IT-11, pp. 3-18, 1965.
14. Information Theory and Reliable Communication. New York: Wiley, 1968.
15. "The random coding bound is tight for the average code," IEEE Trans. Inform. Theory, vol. IT-19, pp. 244-246, 1973.
16. E.N. Gilbert, "A comparison of signalling alphabets," Bell Syst. Tech. J., vol. 31, no. 3, pp. 504-522, 1952.
17. R.W. Hamming, "Error detecting and error correcting codes," Bell Syst. Tech. J., vol. 29, pp. 147-160, 1950.
18. G. Kalai and N. Linial, "On the distance distribution of codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1467-1472, Sept. 1995.
19. T. Kasami, T. K10ve, and S. Lin, "Linear block codes for error detection," IEEE Trans. Inform. Theory, vol. IT-29, pp. 131-136, Jan. 1983.
20. G.L. Katsman, "Upper bounds on the probability of undetected error," Probl. Pered. Inform., vol. 31, no. 1, pp. 13-16, 1995.
21. T. Klove, "Generalizations of the Korzhik bound," IEEE Trans. Inform. Theory, vol. IT-30, pp. 771-773, Sept. 1984.
22. "Using codes for error correction and detection," IEEE Trans. Inform. Theory, vol. IT-30, pp. 868-870, Dec. 1984.
23. "Optimal codes for error detection," IEEE Trans. Inform. Theory, vol. 38, pp. 47989, Mar. 1992.
24. "The weight distribution of cosets," IEEE Trans. Inform. Theory, vol. 40, pp. 911-913, May 1994.
25. "Bounds on the weight distribution of cosets," IEEE Trans. Inform. Theory, vol. 42, pp. 2257-2260, 1996.
26. T. Klove and V. I. Korzhik, Error Detecting Codes. Boston, MA: Kluwer, 1995.
27. V.I. Korzhik, "Bounds on undetected error probability and optimum group codes in a channel with feedback," Radiotech., vol. 20, no. 1, pp. 27-33, 1965.
28. V.N. Koshelev, "On some properties of random group codes of great length," Probl. Pered. Inform., vol. 1, no. 4, pp. 35-38, 1965.
29. I. Krasikov and S. Litsyn, "On integral zeros of Krawtchouk polynomials," J. Comb. Theory, Ser. A, vol. 74, no. 1, pp. 71-99, 1996.
30. "Estimates for the range of binomiality in codes' spectra," IEEE Trans. Inform. Theory, vol. 43, pp. 987-991, 1997.
31. "Bounds on spectra of codes with known dual distance," Des., Codes Cryptogr., vol. 13, no. 3, pp. 285-298, 1998.
32. D.E. Lazic and V. Senk, "A direct geometrical method for bounding the error exponent for any specific family of channel codes-Part I: Cutoff rate lower bound for block codes," IEEE Trans. Inform. Theory, vol. 38, pp. 1548-1559, July 1992.
33. V.K. Leont'ev, "Error-detecting encoding," Probl. Pered. Inform., vol. 8, no. 2, pp. 6-14, 1972. (English translation: Prob. Inform. Transm., vol. 8, no. 2, pp. 86-92, 1972.)
34. S.K. Leung-Yan-Cheong, E. R. Barnes, and D. U. Friedman, "On some properties of undetected error probability of linear codes," IEEE Trans. Inform. Theory, vol. IT-25, pp. 110-112, Jan. 1979.
35. S.K. Leung-Yan-Cheong and M. E. Hellman, "Concerning a bound on undetected erro probability," IEEE Trans. Inform. Theory, vol. IT-22, pp. 235-237, Mar. 1976.
36. V.I. Levenshtein, "Minimum redundancy of binary error-correcting codes," Probl. Pered. Inform., vol. 10, no. 2, pp. 110-123, 1974.
37. "Bounds on the probability of undetected error," Probl. Pered. Inform., vol. 13, no. 1, pp. 3-18, 1977.
38. "Bounds for packings of metric spaces and some applications," Probl. Kibern., vol. 40, pp. 43-110, 1983 (in Russian).
39. "On the straight-line bound for the undetected error exponent," Probl. Pered. Inform., vol. 25, pp. 33-37, 1989.
40. "Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces," IEEE Trans. Inform. Theory, vol. 41, pp. 1303-1321, 1995.
41. J.H. van Lint, Introduction to Coding Theory. New York: Spinger-Verlag, 1992.
42. S. Litsyn and B. Sudakov, "New upper bounds on error exponents. Part II," in preparation.
43. F.J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes Amsterdam, The Netherlands: North-Holland, 1977.
44. R.J. McEliece and J. K. Omura, "An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels," IEEE Trans. Inform. Theory, vol. IT-23, pp. 611-613, Sept. 1977.
45. R.J. McEliece, E. R. Rodemich, H. Rumsey Jr., and L. R. Welch, "New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, Mar. 1977.
46. J.K. Omura, "On general Gilbert bounds," IEEE Trans. Inform. Theory, vol. IT-19, pp. 661-665, Sept. 1973.
47. "Expurgated bounds, Bhattacharya distance, and rate distortion funcions," Inform. Contr., vol. 24, pp. 358-383, 1974.
48. J.N. Pierce, "Limit distribution of the minimum distance of random linear codes," IEEE Trans. Inform. Theory, vol. IT-13, pp. 595-599, 1967.
49. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994.
50. C.E. Shannon, "A mathematical theory of communications," Bell Syst. Tech. J., vol. 27, pp. 37923; 623-656, 1948.
51. C.E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds to error probability for coding on discrete memoryless channels," Inform. Contr., vol. 10, pp. 65-103 (Part I); 522-552 (Part II), 1967.
52. G. Szégo, Orthogonal Polynomials (Amer. Math. Soc. Colloq. Publ.), vol. 23. Providence, RI: 1975.
53. R.R. Varshamov, "An estimate for the number of signals in codes correcting errors," Dokl. Akad. Nauk SSSR, vol. 117, no. 5, pp. 739-741, 1957.
54. A.J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
55. J.K. Wolf, A. M. Michelson, and A. H. Levesque, "On the probability of undetected error for linear block codes," IEEE Trans. Commun., vol. COM-30, pp. 317-324, Feb. 1982.