Geodesic
E-capacity bounds of compound channels
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 3 (1987), pp. 22-29.

Voir la notice de l'article provenant de la source Math-Net.Ru

E-capacity upper and lower bounds of discrete memoryless compound channel have been found. Cases, when the transmission matrix is known or unknown on coder and decoder have been considered. 
@article{UZERU_1987_3_a3,
     author = {M. E. Haroutunian},
     title = {E-capacity bounds of compound channels},
     journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
     pages = {22--29},
     publisher = {mathdoc},
     number = {3},
     year = {1987},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/UZERU_1987_3_a3/}
}
TY  - JOUR
AU  - M. E. Haroutunian
TI  - E-capacity bounds of compound channels
JO  - Proceedings of the Yerevan State University. Physical and mathematical sciences
PY  - 1987
SP  - 22
EP  - 29
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/UZERU_1987_3_a3/
LA  - ru
ID  - UZERU_1987_3_a3
ER  - 
%0 Journal Article
%A M. E. Haroutunian
%T E-capacity bounds of compound channels
%J Proceedings of the Yerevan State University. Physical and mathematical sciences
%D 1987
%P 22-29
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/UZERU_1987_3_a3/
%G ru
%F UZERU_1987_3_a3
M. E. Haroutunian. E-capacity bounds of compound channels. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 3 (1987), pp. 22-29. http://geodesic.mathdoc.fr/item/UZERU_1987_3_a3/

[1] D. Blackwell, L. Breiman, A. J. Thomasian, “The Capacity of a Class of Channels”, Ann. Math. Statist., 30:4 (1959), 1229–1241 | DOI | MR | Zbl

[2] R. L. Dobrushin, “Obschaya formulirovka osnovnoi teoremy Shennona v teorii informatsii”, UMN, 14:6 (1959), 3–104 | MR | Zbl

[3] J. Wolfowitz, “Simultaneous channels”, Arch. Rational Mech. Anal., 4:4 (1960), 371–386 | MR | Zbl

[4] I. Chisar, Ya. Kerner, Teoriya informatsii: teoremy kodirovaniya dlya diskretnykh sistem bez pamyati, Per. s angl., Mir, M., 1985, 400 pp. | Zbl

[5] I. Csiszar, J. Körner, “Graph Decomposition: a New Key to Coding Theorems”, IEEE Trans. Inform. Theory, 27 (1981), 5–12 | DOI | MR | Zbl

[6] M. E. Arutyunyan, G. Belbashir, “Nizhnyaya granitsa optimalnoi skorosti peredachi pri zadannoi eksponente veroyatnosti oshibki dlya diskretnogo kanala bez pamyati i dlya nesimmetrichnogo shirokoveschatelnogo kanala”, Tez. dokl. VI mezhdunar. simp. po teorii informatsii, v. I, Tashkent, 1984, 19–21

[7] M. E. Arutyunyan, “Kombinatornyi metod postroeniya verkhnei granitsy E-propusknoi sposobnosti”, Matematika. Mezhvuzov, sb. nauch. tr., I (1982), 213–220, Erevan | MR

[8] M. E. Arutyunyan, “Granitsy E-propusknoi sposobnosti dlya sostavnykh kanalov”, Tez. dokl. IX simp. po probleme izbytochnosti v informatsionnykh sistemakh, v. 1, 1986, 23–25

[9] J. Wolfowitz, Coding Theorems of Information Theory, Springer, Berlin–Heidelberg, 1961 | MR | Zbl

[10] G. Dueck, J. Körner, “Reliability Function of a Discrete Memoryless Channel at Rates above Capacity”, IEEE Trans. Inform. Theory, 25:1 (1979), 82–85 | DOI | MR | Zbl