CODING THEOREM FOR THE DISCRETE MEMORYLESS BROADCAST CHANNEL

被引：383

作者：

MARTON, K

机构：

[1] Mathematical Institute of the Hungarian Academy of Sciences, Hungary, H-1053 Budapest

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1979年 / 25卷 / 03期

关键词：

D O I：

10.1109/TIT.1979.1056046

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A coding theorem for the discrete memoryless broadcast channel is proved for the case where no common message is to be transmitted. The theorem is a generalization of the results of Cover and van der Meulen on this problem. The result is tight for broadcast channels having one deterministic component. © 1979 IEEE

引用

页码：306 / 311

页数：6

共 19 条

[1]

Ahlswede R., 1974, 7 PRAG C INF THEOR

[2] SOURCE CODING WITH SIDE INFORMATION AND A CONVERSE FOR DEGRADED BROADCAST CHANNELS [J].

AHLSWEDE, RF ;

KORNER, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (06) :629-637

[3]

BERGMANS PF, 1973, IEEE T INFORM THEORY, V15, P197

[4] ACHIEVABLE RATE REGION FOR BROADCAST CHANNEL [J].

COVER, TM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :399-404

[5]

CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892

[6]

ELGAMAL A, 1978, 24 STANDF U DEP STAT

[7]

Gacs P., 1973, Problems of Control and Information Theory, V2, P149

[8]

Gallager Robert G., 1974, PROBL PEREDACHI INF, V10, P3

[9]

GELFAND S, UNPUBLISHED

[10]

GELFAND SI, 1977, PROBL PEREDACHI INF, V13, P106

← 1 2 →