|
Problemy Peredachi Informatsii, 1990, Volume 26, Issue 4, Pages 16–23
(Mi ppi626)
|
|
|
|
Information Theory and Coding Theory
$E$-Capacity of an Arbitrarily Varying Channel with an Informed Coder
M. E. Haroutunian
Abstract:
Spherical packing and random coding bounds are constructed for the $E$-capacity of an arbitrarily varying channel with average and maximum error probability for the case when the sequence of channel states is known during coding and unknown during decoding [R. Ahlswede, IEEE Trans. Inf. Theory, 32, No. 5, 621–629 (1986)].
Received: 25.12.1987 Revised: 16.03.1990
Citation:
M. E. Haroutunian, “$E$-Capacity of an Arbitrarily Varying Channel with an Informed Coder”, Probl. Peredachi Inf., 26:4 (1990), 16–23; Problems Inform. Transmission, 26:4 (1990), 299–305
Linking options:
https://www.mathnet.ru/eng/ppi626 https://www.mathnet.ru/eng/ppi/v26/i4/p16
|
Statistics & downloads: |
Abstract page: | 172 | Full-text PDF : | 87 |
|