This article is cited in 1 paper

Information Theory and Coding Theory

Upper Bounds on the Probability of Nondetected Error

G. L. Katsman


Abstract: An assertion is proved which yields upper bounds on the probability of nondetected error in a binary symmetric channel. The previously known bounds [Levenstein, Probl. Peredachi Inf., 13, No. 1, 3–18 (1997); Kasami et al., IEEE Trans. Inf. Theory, 24, 76–80 (1978) ] can be obtained as special cases of this assertion.

UDC: 621.391.1:519.2

Received: 02.03.1994

 English version: Problems of Information Transmission, 1995, 31:1, 10–13

Bibliographic databases:

•