N-USER TRELLIS CODING FOR A CLASS OF MULTIPLE-ACCESS CHANNELS

被引：22

作者：

CHEVILLAT, PR

机构：

来源：

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

关键词：

D O I：

10.1109/TIT.1981.1056301

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：114 / 120

页数：7

相关论文

共 18 条

[1] CODING FOR T-USER MULTIPLE-ACCESS CHANNELS
CHANG, S
WELDON, EJ
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (06) : 684 - 691
[2] CHEVILLAT PR, 1978, RZ928 IBM RES REPT
[3] CONVOLUTIONAL CODES .1. ALGEBRAIC STRUCTURE
FORNEY, GD
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (06) : 720 - +
[4] BOUNDS ON ACHIEVABLE RATES OF BLOCK CODING FOR A MEMORYLESS MULTIPLE-ACCESS CHANNEL
KASAMI, T
LIN, S
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (02) : 187 - 197
[5] CODING FOR A MULTIPLE-ACCESS CHANNEL
KASAMI, T
LIN, S
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (02) : 129 - 137
[6] OMURA JK, 1979, 1979 C REC NAT TEL C, V2
[7] SHORT BINARY CONVOLUTIONAL CODES WITH MAXIMAL FREE DISTANCE FOR RATES 2-3 AND 3-4
PAASKE, E
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (05) : 683 - 689
[8] BINARY CONVOLUTIONAL CODES FOR A MULTIPLE-ACCESS CHANNEL
PETERSON, R
COSTELLO, DJ
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (01) : 101 - 105
[9] PETERSON R, 1978, THESIS ILLINOIS I TE
[10] PETERSON RL, 1979, 1979 IEEE INT S INF