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 条
  • [41] Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
    Boche, Holger
    Janssen, Gisbert
    Saeedinaeeni, Sajad
    [J]. QUANTUM INFORMATION PROCESSING, 2019, 18 (08)
  • [42] Coding Scheme for T-User Noisy Multiple-Access Adder Channel
    Lu, Shan
    Hou, Wei
    Cheng, Jun
    [J]. 2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 536 - 540
  • [43] Outage Probability Analysis on Multiple-Access Relaying Channel with Analog Network Coding
    Ouyang, Yuhua
    Jia, Xiangdong
    [J]. 2010 6TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS NETWORKING AND MOBILE COMPUTING (WICOM), 2010,
  • [44] RANDOM-ACCESS WITH NOTIFICATION - A NEW MULTIPLE-ACCESS SCHEME FOR VSAT NETWORKS
    CHITRE, DM
    BRIANCON, AC
    KOHLI, R
    [J]. COMSAT TECHNICAL REVIEW, 1989, 19 (01): : 99 - 121
  • [45] A New Achievable Rate Region for Multiple-Access Channel with States
    Heidari, Mohsen
    Shirani, Farhad
    Pradhan, S. Sandeep
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 36 - 40
  • [46] Low-Complexity Coding Scheme to Approach Multiple-Access Channel Capacity
    Song, Guanghui
    Cheng, Jun
    [J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2106 - 2110
  • [47] On a Multiple-Access in a Vector Disjunctive Channel
    Frolov, Alexey
    Zyablov, Victor
    Sidorenko, Vladimir
    Fischer, Robert
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 211 - +
  • [48] The Dirty MIMO Multiple-Access Channel
    Khina, Anatoly
    Kochman, Yuval
    Erez, Uri
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (09) : 6031 - 6040
  • [49] Multiple-Access Channel Resolvability with Cribbing
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2052 - 2056
  • [50] Joint network-channel coding for the multiple-access relay channel based on turbo codes
    Hausl, Christoph
    [J]. EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2009, 20 (02): : 175 - 181
12345