|
Problemy Peredachi Informatsii, 1980, Volume 16, Issue 2, Pages 18–24
(Mi ppi1437)
|
|
|
|
Information Theory
Lower Bound for Ensemble-Average Error Probability for a Discrete Memoryless Channel
A. G. D'yachkov
Abstract:
The article obtains a lower asymptotic bound for the average error probability over a standard ensemble of codes for the case of decoding using a list of fixed length $L\geq 1$ for a discrete memoryless channel. For all coding rates, this bound establishes the optimality of the exponent of the familiar Gallager upper bound [E. G. Gallager, Information Theory and Reliable Communication, Wiley, 1968].
Received: 24.05.1977
Citation:
A. G. D'yachkov, “Lower Bound for Ensemble-Average Error Probability for a Discrete Memoryless Channel”, Probl. Peredachi Inf., 16:2 (1980), 18–24; Problems Inform. Transmission, 16:2 (1980), 93–98
Linking options:
https://www.mathnet.ru/eng/ppi1437 https://www.mathnet.ru/eng/ppi/v16/i2/p18
|
Statistics & downloads: |
Abstract page: | 211 | Full-text PDF : | 91 |
|