THE DISCRETE MEMORYLESS MULTIPLE-ACCESS CHANNEL WITH CRIBBING ENCODERS

被引:158
作者
WILLEMS, FMJ [1 ]
VANDERMEULEN, EC [1 ]
机构
[1] KATHOLIEKE UNIV LEUVEN,DEPT WISKUNDE,B-3030 LEUVEN,BELGIUM
关键词
D O I
10.1109/TIT.1985.1057042
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:313 / 327
页数:15
相关论文
共 17 条
[1]   CAPACITY REGION OF A CHANNEL WITH 2 SENDERS AND 2 RECEIVERS [J].
AHLSWEDE, R .
ANNALS OF PROBABILITY, 1974, 2 (05) :805-814
[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]  
CARLEIAL AB, 1975, 66031 STANF U CTR SY
[4]   AN ACHIEVABLE RATE REGION FOR THE MULTIPLE-ACCESS CHANNEL WITH FEEDBACK [J].
COVER, TM ;
LEUNG, CSK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (03) :292-298
[5]   ACHIEVABLE RATE REGION FOR BROADCAST CHANNEL [J].
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :399-404
[6]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[7]   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
[8]  
EGGLESTON HG, 1963, CONVEXITY
[9]   MULTIPLE USER INFORMATION-THEORY [J].
ELGAMAL, A ;
COVER, TM .
PROCEEDINGS OF THE IEEE, 1980, 68 (12) :1466-1483
[10]  
HAN TS, 1981, IEEE T INFORM THEORY, V27, P49