An Improved Upper Bound on the Block Coding Error Exponent for Binary-Input Discrete Memoryless Channels

IEEE Transactions on Information Theory

Volumn 23, Issue 5, 1977, Pages 611-613

  Mceliece, Robert J ^a   Omura, Jim K ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0017536248     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1977.1055772     Document Type: Article

References (5)

1. 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.
2. 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.
3. 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), pp. 522–552 (Part II), Jan. 1967.
4. J. K. Omura, “Expurgated bounds, Bhattacharya distance, and rate distortion functions,” Inform. Contr., vol. 24, pp. 358–383, Apr. 1974.
5. —, “On general Gilbert bounds,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 661–665, Sept. 1973.