RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1991 Volume 27, Issue 1, Pages 14–23 (Mi ppi542)

This article is cited in 1 paper

Information Theory and Coding Theory

Bounds on $E$-Capacity of a Channel with a Random Parameter

M. E. Arutyunyan


Abstract: We obtain a random-coding lower bound for the $E$-capacity of a channel with a random parameter under complete information about the encoder states [S. I. Gelfand and M. S. Pinsker, Probl. Contr. Inf. Theory, 9, no. 1, 19–31 (1980)] and also improve the upper bound of [E. A. Haroutunian and M. E. Haroutunian, Probl. Contr. Inf. Theory, 17, No. 2, 99–105 (1988)].

UDC: 621.391.1:519.27

Received: 20.04.1988
Revised: 16.03.1990


 English version:
Problems of Information Transmission, 1991, 27:1, 10–18

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024