CODING FOR T-USER MULTIPLE-ACCESS CHANNELS

被引：122

作者：

CHANG, S ^{[1
]}

WELDON, EJ ^{[1
]}

机构：

[1] UNIV HAWAII,DEPT ELECT ENGN,HONOLULU,HI 96822

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1979年 / 25卷 / 06期

关键词：

D O I：

10.1109/TIT.1979.1056109

中图分类号：

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

学科分类号：

0812 ;

摘要：

Coding schemes for the binary memoryless T-user adder channel are investigated in this paper. First upper and lower bounds on the capacity sum, which are asymptotically tight with increasing T, are derived for the noiseless case. Second, a class of T-user uniquely decodable codes with rates, asymptotically in T, equal to the maximal achievable values is constructed. A decoding algorithm for these codes is also presented. Next, a class of error-correcting codes for the noisy T-user adder channel is constructed. It is shown that these codes can be used to construct multi-level codes suitable for use on the additive white Gaussian noise channel. ©1979 IEEE

引用

页码：684 / 691

页数：8

共 22 条

[1] CAPACITY REGION OF A CHANNEL WITH 2 SENDERS AND 2 RECEIVERS
AHLSWEDE, R
[J]. ANNALS OF PROBABILITY, 1974, 2 (05) : 805 - 814
[2] AHLSWEDE R, 1971, 2ND P INT S INF THEO, P23
[3] Bellman R., 1961, BRIEF INTRO THETA FU
[4] Cover T. M., 1975, ADV COMMUNICATION SY, V4, P229
[5] Cover T. M., 1976, 17 STANF U DEP STAT
[6] CAPACITY REGION OF A MULTIPLE-ACCESS DISCRETE MEMORYLESS CHANNEL CAN INCREASE WITH FEEDBACK
GAARDER, NT
WOLF, JK
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (01) : 100 - 102
[7] 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
[8] CODING FOR A MULTIPLE-ACCESS CHANNEL
KASAMI, T
LIN, S
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (02) : 129 - 137
[9] Liao H. H. J., 1972, THESIS U HAWAII HONO
[10] Peterson WW, 1972, ERROR CORRECTING COD

← 1 2 3 →