Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels

被引:8
作者
Farkas, Lorant [1 ]
Koi, Tamas [2 ]
机构
[1] Budapest Univ Technol & Econ, Dept Anal, H-1111 Budapest, Hungary
[2] Budapest Univ Technol & Econ, Dept Stochast, MTA BME Stochast Res Grp, H-1111 Budapest, Hungary
关键词
Random access; error exponent; multiple access; source-channel coding; collision detection; codebook library; packing lemma; universal coding;
D O I
10.1109/TIT.2015.2428254
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A new universal coding/decoding scheme for random access with collision detection is given in case of two senders. The result is used to give achievable joint source-channel coding error exponents for multiple access channel and independent sources. In a modified model admitting zero rate communication between the senders, an improved exponent is derived, of form similar to Csiszar's joint source-channel exponent for the one-sender case.
引用
收藏
页码:3029 / 3040
页数:12
相关论文
共 50 条
  • [1] Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels
    Farkas, Lorant
    Koi, Tamas
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 374 - 378
  • [2] Error Exponents for Joint Source-Channel Coding With Side Information
    Chang, Cheng
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (10) : 6877 - 6889
  • [3] Two Contributions to Error Exponents for Asynchronous Multiple Access Channel
    Farkas, Lorant
    Koi, Tamas
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2664 - 2668
  • [4] Error Performance of Channel Coding in Random-Access Communication
    Wang, Zheng
    Luo, Jie
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) : 3961 - 3974
  • [5] Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform Synchronism
    Csiszar, Imre
    Farkas, Lorant
    Koi, Tamas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (12) : 7684 - 7707
  • [6] Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems
    Zhong, Yangfan
    Alajaji, Fady
    Campbell, L. Lorne
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (04) : 1487 - 1518
  • [7] Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios
    Chen, Shuqing
    Effros, Michelle
    Kostina, Victoria
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (11) : 6688 - 6722
  • [8] Random-Coding Joint Source-Channel Bounds
    Campo, Adria Tauste
    Vazquez-Vilar, Gonzalo
    Guillen i Fabregas, Albert
    Martinez, Alfonso
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 899 - 902
  • [9] A new universal random coding bound for the multiple-access channel
    Liu, YS
    Hughes, BL
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) : 376 - 386
  • [10] Unsourced Multiple Access: A Coding Paradigm for Massive Random Access
    Liva, Gianluigi
    Polyanskiy, Yury
    PROCEEDINGS OF THE IEEE, 2024, 112 (09) : 1214 - 1229