ERROR-PROBABILITY AND FREE DISTANCE BOUNDS FOR 2-USER TREE CODES ON MULTIPLE-ACCESS CHANNELS

被引：10

作者：

PETERSON, RL

COSTELLO, DJ

机构：

[1] BELL TEL LABS INC, DEPT MOBILE SYST ENGN, HOLMDEL, NJ 07733 USA

[2] IIT, DEPT ELECT ENGN, CHICAGO, IL 60616 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1980年 / 26卷 / 06期

关键词：

D O I：

10.1109/TIT.1980.1056274

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：658 / 670

页数：13

共 20 条

[1]

CHANG SC, 1977, THESIS U HAWAII HONO

[2]

CHEVILLAT PR, UNPUBLISHED

[3]

FORNEY GD, 1974, INFORM CONTROL, V25, P222, DOI 10.1016/S0019-9958(74)90870-5

[4]

GALLAGER RG, 1968, INFORMATION THEORY R

[5] BOUNDS ON ACHIEVABLE RATES OF BLOCK CODING FOR A MEMORYLESS MULTIPLE-ACCESS CHANNEL [J].

KASAMI, T ;

LIN, S .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (02) :187-197

[6] CODING FOR A MULTIPLE-ACCESS CHANNEL [J].

KASAMI, T ;

LIN, S .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (02) :129-137

[7] DECODING OF LINEAR DELTA-DECODABLE CODES FOR A MULTIPLE-ACCESS CHANNEL [J].

KASAMI, T ;

LIN, S .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (05) :633-635

[8]

MASSEY JL, 1976, 1976 IEEE INT C COMM

[9] CONVOLUTIONAL TREE CODES FOR MULTIPLE ACCESS CHANNELS [J].

OHKUBO, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (03) :397-399

[10]

PETERSON R, 1977, 15TH P ANN ALL C COM, P439

← 1 2 →