|
|
Problemy Peredachi Informatsii, 1995, Volume 31, Issue 1, Pages 13–16
(Mi ppi261)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 02.03.1994
Citation:
G. L. Katsman, “Upper Bounds on the Probability of Nondetected Error”, Probl. Peredachi Inf., 31:1 (1995), 13–16; Problems Inform. Transmission, 31:1 (1995), 10–13
Linking options:
https://www.mathnet.ru/eng/ppi261 https://www.mathnet.ru/eng/ppi/v31/i1/p13
|
|