A PROOF OF MARTON CODING THEOREM FOR THE DISCRETE MEMORYLESS BROADCAST CHANNEL

被引：97

作者：

ELGAMAL, A

VANDERMEULEN, EC

机构：

[1] UNIV SO CALIF,LOS ANGELES,CA 90007

[2] CATHOLIC UNIV LEUVEN,DEPT MATH,B-3000 LOUVAIN,BELGIUM

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1981年 / 27卷 / 01期

关键词：

D O I：

10.1109/TIT.1981.1056302

中图分类号：

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

学科分类号：

0812 [计算机科学与技术];

摘要：

引用

页码：120 / 122

页数：3

共 10 条

[1]

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

[2]

ACHIEVABLE RATE REGION FOR BROADCAST CHANNEL [J].

COVER, TM .

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

[3]

COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084

[4]

PROOF OF DATA COMPRESSION THEOREM OF SLEPIAN AND WOLF FOR ERGODIC SOURCES [J].

COVER, TM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (02) :226-228

[5]

Gel'fand S. I., 1977, Problems of Information Transmission, V13, P240

[6]

KUZNETSOV AV, 1974, PROBL INFORM TRANSM, V10, P132

[7]

CODING THEOREM FOR THE DISCRETE MEMORYLESS BROADCAST CHANNEL [J].

MARTON, K .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (03) :306-311

[8]

Pinsker M. S., 1978, Problems of Information Transmission, V14, P97

[9]

SURVEY OF MULTI-WAY CHANNELS IN INFORMATION-THEORY - 1961-1976 [J].

VANDERMEULEN, EC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (01) :1-37

[10]

RANDOM CODING THEOREMS FOR GENERAL DISCRETE MEMORYLESS BROADCAST CHANNEL [J].

VANDERMEULEN, EC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (02) :180-190

← 1 →