BOUNDS ON ACHIEVABLE RATES OF BLOCK CODING FOR A MEMORYLESS MULTIPLE-ACCESS CHANNEL

被引：36
作者：
KASAMI, T [1 ]
LIN, S [1 ]
机构：
[1] UNIV HAWAII,DEPT ELECT ENGN,HONOLULU,HI 96822
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1978年 / 24卷 / 02期
关键词：
D O I：
10.1109/TIT.1978.1055860
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：187 / 197
页数：11
相关论文
共 14 条
[1]  
AHLSWEDE R, 1971, 2ND P INT S INF TRAN
[2]  
BERLEKAMP ER, 1968, ALGEBRAIC CODING THE
[3]   CAPACITY REGION OF A MULTIPLE-ACCESS DISCRETE MEMORYLESS CHANNEL CAN INCREASE WITH FEEDBACK [J].
GAARDER, NT ;
WOLF, JK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (01) :100-102
[4]   CODING FOR A MULTIPLE-ACCESS CHANNEL [J].
KASAMI, T ;
LIN, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (02) :129-137
[5]  
KASAMI T, 1976, BOUNDS ACHIEVABLE RA
[6]  
KASAMI T, 1975 HUNG C INF THEO
[7]  
KASAMI T, 1976, JUN INT S INF THEOR
[8]  
Liao H. H. J., 1972, THESIS U HAWAII HONO
[9]   NEW UPPER BOUNDS ON RATE OF A CODE VIA DELSARTE-MACWILLIAMS INEQUALITIES [J].
MCELIECE, RJ ;
RODEMICH, ER ;
RUMSEY, H ;
WELCH, LR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (02) :157-166
[10]  
Peterson W. W., 1971, ERROR CORRECTING COD
12