|
Problemy Peredachi Informatsii, 1983, Volume 19, Issue 1, Pages 9–20
(Mi ppi1160)
|
|
|
|
Information Theory and Coding Theory
Random-Coding Bounds for Some Broadcast Channels
G. Sh. Poltyrev
Abstract:
The author establishes upper bounds for random coding for the decoding error probabilities in a discreet memoryless broadcast channel with two receivers, for the case of transmission of common and only private information. The bounds are more precise than those given in [B. D. Kudryashov and G. Sh. Poltyrev, Probl. Peredachi Inf., 1979, vol. 15, no. 3, pp. 3–17].
Received: 05.05.1981
Citation:
G. Sh. Poltyrev, “Random-Coding Bounds for Some Broadcast Channels”, Probl. Peredachi Inf., 19:1 (1983), 9–20; Problems Inform. Transmission, 19:1 (1983), 6–16
Linking options:
https://www.mathnet.ru/eng/ppi1160 https://www.mathnet.ru/eng/ppi/v19/i1/p9
|
Statistics & downloads: |
Abstract page: | 198 | Full-text PDF : | 130 |
|