ACHIEVABLE RATE REGION FOR BROADCAST CHANNEL

被引：100
作者：
COVER, TM
机构：
[1] STANFORD UNIV, DEPT ELECT ENGN, STANFORD, CA 94305 USA
[2] STANFORD UNIV, DEPT STATISTICS, STANFORD, CA 94305 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1975年 / 21卷 / 04期
关键词：
D O I：
10.1109/TIT.1975.1055418
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：399 / 404
页数：6
相关论文
共 11 条
[1]   SIMPLE CONVERSE FOR BROADCAST CHANNELS WITH ADDITIVE WHITE GAUSSIAN NOISE [J].
BERGMANS, PP .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :279-280
[2]  
BERGMANS PP, 1972, THESIS STANFORD U
[3]   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
[4]  
FORNEY GD, UNPUBLISHED CLASS NO
[5]  
GALLAGER RG, TO BE PUBLISHED
[6]  
SLEPIAN D, 1974, KEY PAPERS DEVELOPME, P437
[7]  
ULREY M, TO BE PUBLISHED
[8]  
ULREY M, 1973, THESIS OHIO STATE U
[9]   RANDOM CODING THEOREMS FOR GENERAL DISCRETE MEMORYLESS BROADCAST CHANNEL [J].
VANDERMEULEN, EC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (02) :180-190
[10]  
WYNER AD, 1973, IEEE T INFORM THEORY, V19, P772, DOI 10.1109/TIT.1973.1055108
12