A new universal random coding bound for the multiple-access channel

被引：55

作者：

Liu, YS ^{[1
]}

Hughes, BL ^{[1
]}

机构：

[1] JOHNS HOPKINS UNIV,DEPT ELECT & COMP ENGN,BALTIMORE,MD 21218

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1996年 / 42卷 / 02期

关键词：

multiple-access channel; multiuser communication; error exponents; universal coding;

D O I：

10.1109/18.485710

中图分类号：

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

学科分类号：

0812 ;

摘要：

The minimum average error probability achievable by block codes on the two-user multiple-access channel is investigated. A new exponential upper bound is found which can be achieved universally for all discrete memoryless multiple-access channels with given input and output alphabets. It is shown that the exponent of this bound is greater than or equal to those of previously known bounds. Moreover, examples are given where the new exponent is strictly larger.

引用

页码：376 / 386

页数：11

共 17 条

[1]

[Anonymous], 2 INT S INF THEOR TS

[2]

ARUTYUNYAN EA, 1975, PROBL PERED INFORM, V11, P23

[3] CODING FOR T-USER MULTIPLE-ACCESS CHANNELS [J].

CHANG, S ;

WELDON, EJ .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (06) :684-691

[4]

CSISZAR I, 1981, INFORMATION THEORY C

[5]

Dueck G., 1978, Problems of Control and Information Theory, V7, P11

[6]

Dyachkov A. G., 1984, Problems of Control and Information Theory, V13, P357

[7]

FARRELL PG, 1981, NEW CONCEPTS MULTIUS, P133

[8] A PERSPECTIVE ON MULTIACCESS CHANNELS [J].

GALLAGER, RG .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (02) :124-142

[9]

GALLAGER RG, 1968, INFORMATION THEORY R

[10]

Liao H., 1972, P INT S INF THEOR AS

← 1 2 →