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
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2015年 / 61卷 / 06期
关键词：
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 条
  • [21] Error Exponent for Multiple Access Channels: Upper Bounds
    Nazari, Ali
    Pradhan, S. Sandeep
    Anastasopoulos, Achilleas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (07) : 3605 - 3621
  • [22] Universal Random Access Error Exponents for Codebooks with Different Word-Lengths
    Farkas, Lorant
    Koi, Tamas
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017,
  • [23] Joint Source-Channel Coding for Semantics-Aware Grant-Free Radio Access in IoT Fog Networks
    Dommel, Johannes
    Utkovski, Zoran
    Simeone, Osvaldo
    Stanczak, Slawomir
    IEEE SIGNAL PROCESSING LETTERS, 2021, 28 : 728 - 732
  • [24] On random coding error exponents of watermarking systems
    Merhav, N
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 420 - 430
  • [25] A Strong Converse for Joint Source-Channel Coding
    Wang, Da
    Ingber, Amir
    Kochman, Yuval
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [26] Joint source-channel coding error exponent for discrete communication systems with Markovian memory
    Zhong, Yanfan
    Alajaji, Fady
    Campbell, L. Lorne
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (12) : 4457 - 4472
  • [27] Error Exponent for Multiple-Access Channels: Lower Bounds
    Nazari, Ali
    Anastasopoulos, Achilleas
    Pradhan, S. Sandeep
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (09) : 5095 - 5115
  • [28] Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels
    Yavas, Recep Can
    Kostina, Victoria
    Effros, Michelle
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (04) : 2367 - 2394
  • [29] Universal Error Exponent for Discrete Asynchronous Multiple Access Channels
    Farkas, Lorant
    Koi, Tamas
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2944 - 2948
  • [30] Interleaved Block Coding for Achieving Gaussian Random Access Channel Capacity
    Aktas, Tugcan
    Sen, Pinar
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 3007 - 3012
12345