|
Problemy Peredachi Informatsii, 1977, Volume 13, Issue 1, Pages 3–18
(Mi ppi1062)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Information Theory
Bounds on the Probability of Undetected Error
V. I. Levenshtein
Abstract:
New upper and lower bounds are obtained for the probability of undetected error for block codes in a binary symmetrical channel (BSC). These bounds improve the available bounds by a factor that increases exponentially with the block length $n$, provided that the transmission rate is fixed and does not exceed the capacity of the BSC. The resultant bounds are used to select the parameters of a quasioptimal code for transmission over a BSC with instantaneous and noiseless feedback.
Received: 04.11.1975
Citation:
V. I. Levenshtein, “Bounds on the Probability of Undetected Error”, Probl. Peredachi Inf., 13:1 (1977), 3–18; Problems Inform. Transmission, 13:1 (1977), 1–12
Linking options:
https://www.mathnet.ru/eng/ppi1062 https://www.mathnet.ru/eng/ppi/v13/i1/p3
|
Statistics & downloads: |
Abstract page: | 421 | Full-text PDF : | 216 | First page: | 1 |
|