|
Problemy Peredachi Informatsii, 1975, Volume 11, Issue 4, Pages 3–12
(Mi ppi1604)
|
|
|
|
Information Theory
Shannon's Theorems for a Complete Class of Discrete Memoryless Channels Whose State is Known at the Output
S. Z. Stambler
Abstract:
Coding theorems and their weak converse are proved for a complete class of discrete memoryless channels for ordinary and randomized codes with mean error, and also for randomized codes with maximum error under the assumption that the channel state is known at the output.
Received: 04.06.1974
Citation:
S. Z. Stambler, “Shannon's Theorems for a Complete Class of Discrete Memoryless Channels Whose State is Known at the Output”, Probl. Peredachi Inf., 11:4 (1975), 3–12; Problems Inform. Transmission, 11:4 (1975), 263–270
Linking options:
https://www.mathnet.ru/eng/ppi1604 https://www.mathnet.ru/eng/ppi/v11/i4/p3
|
Statistics & downloads: |
Abstract page: | 271 | Full-text PDF : | 122 |
|