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

被引：54
|
作者：
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
相关论文
共 50 条
  • [31] 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
  • [32] The Poisson multiple-access channel
    Lapidoth, A
    Shamai, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) : 488 - 501
  • [33] Multi-Class Cost-Constrained Random Coding for Correlated Sources over the Multiple-Access Channel
    Rezazadeh, Arezou
    Font-Segura, Josep
    Martinez, Alfonso
    Fabregas, Albert Guillen i
    [J]. ENTROPY, 2021, 23 (05)
  • [34] Bounds of E-capacity for multiple-access channel with random parameter
    Haroutunian, M. E.
    [J]. General Theory of Information Transfer and Combinatorics, 2006, 4123 : 196 - 217
  • [35] FORWARD COLLISION RESOLUTION - A TECHNIQUE FOR RANDOM MULTIPLE-ACCESS TO THE ADDER CHANNEL
    BARDAVID, I
    PLOTNIK, E
    ROM, R
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (05) : 1671 - 1675
  • [36] ROBUST CODING FOR MULTIPLE-ACCESS CHANNELS
    GERANIOTIS, E
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (04) : 550 - 560
  • [37] Universal classical-quantum multiple access channel coding
    Hayashi, Masahito
    Cai, Ning
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 402 - 407
  • [38] An upper bound on the average throughput of opportunistic transmission in a multiple-access fading channel
    Djonin, DV
    Bhargava, VK
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (10) : 1618 - 1621
  • [39] A Formulation of the Channel Capacity of Multiple-Access Channel
    Watanabe, Yoichiro
    Kamoi, Koichi
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (05) : 2083 - 2096
  • [40] Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
    Holger Boche
    Gisbert Janßen
    Sajad Saeedinaeeni
    [J]. Quantum Information Processing, 2019, 18
12345