M. E. Haroutunian, “<nobr>$E$</nobr>-Capacity of an Arbitrarily Varying Channel with an Informed Coder”, Probl. Peredachi Inf., 1990, Volume 26, Issue 4,Pages <nobr>16

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)].

UDC: 621.391.1

Received: 25.12.1987
Revised: 16.03.1990

English version: Problems of Information Transmission, 1990, 26:4, 299–305

Bibliographic databases: