Abstract
We suggest a new approach to constructing a lower bound on the decoding error probability in a discrete memoryless channel at zero transmission rate. This approach considerably simplifies derivation of the bound, making it more natural, and simultaneously improves the remainder term of the estimate for the decoding error exponent.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Shannon, T.E., Gallager, R.G., and Berlekamp, E.R., Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I, II, Inf. Control, 1976, vol. 10, no. 1, pp. 65-103; no. 5, pp. 522-552.
Komlos, J., A Strange Pigeon-Hole Principle, Order, 1990, vol. 7, pp. 107-113.
Feller, W., An Introduction to Probability Theory and Its Applications, New York: Wiley, 1970, vol. 1, 3rd ed.; 1971, vol. 2, 2nd ed. Translated under the title Vvedenie v teoriyu veroyatnostej i ee prilozheniya, Moscow: Mir, 1984, 2 vols.
Blinovsky, V.M., Asymptotic Combinatorial Coding Theory, Boston: Kluwer, 1997.
Burnashev, M.V., On One Useful Inequality in Testing of Hypotheses, IEEE Trans. Inf. Theory, 1998, vol. 44, no. 4, pp. 1668-1670.
Rights and permissions
About this article
Cite this article
Blinovsky, V.M. New Approach to Estimation of the Decoding Error Probability. Problems of Information Transmission 38, 16–19 (2002). https://doi.org/10.1023/A:1020034020985
Issue Date:
DOI: https://doi.org/10.1023/A:1020034020985