Capacity-Achieving Coding Scheme for the MAC with Degraded Message Sets and Feedback

被引:0
|
作者
Sabag, Oron [1 ]
Permuter, Haim H. [1 ]
Shamai , Shlomo [2 ]
机构
[1] Ben Gurion Univ Negev, Beer Sheva, Israel
[2] Technion, Haifa, Israel
关键词
MULTIPLE-ACCESS CHANNEL; REGION; BOUNDS;
D O I
10.1109/isit.2019.8849326
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The multiple access channel (MAC) with degraded message sets and feedback is considered. We show that feedback does not increase the capacity region of this setting, and present a capacity-achieving coding scheme. The coding scheme is inspired by the posterior matching principle for the memoryless channel, but for two transmitters. It is shown that the recursive design of the transmitters and decoder is also maintained in this multi-user setting, leading to a constructive and simple coding scheme. It is interesting to note that the weak transmitter performs its encoding with respect to the decoder's belief as expected, but the strong encoder performs its encoding with respect to the weak encoder's belief and not the decoder's belief. To the best of our knowledge, this is the first matching scheme for a multi-user setting with finite alphabets and feedback.
引用
收藏
页码:2259 / 2263
页数:5
相关论文
共 50 条
  • [21] The Capacity Region of a Class of Z Channels With Degraded Message Sets
    Liu, Nan
    Kang, Wei
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (10) : 6144 - 6153
  • [22] On the capacity of Gaussian weak interference channels with degraded message sets
    Wu, Wei
    Vishwanath, Sriram
    Arapostathis, Ari
    2006 40TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-4, 2006, : 1703 - 1708
  • [23] Second-Order Asymptotics for the Discrete Memoryless MAC with Degraded Message Sets
    Scarlett, Jonathan
    Tan, Vincent Y. F.
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2964 - 2968
  • [24] On the Gaussian MAC with Degraded Message Sets and Long-Term Power Constraints
    Amor, Selma Belhadj
    Tan, Vincent Y. F.
    2017 IEEE INFORMATION THEORY WORKSHOP (ITW), 2017, : 399 - 403
  • [25] CAPACITY-ACHIEVING PRIVATE INFORMATION RETRIEVAL SCHEME WITH A SMALLER SUB-PACKETIZATION
    Zhang, Wenqin
    Zhou, Zhengchun
    Parampalli, Udaya
    Sidorenko, Vladimir
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2021, 15 (02) : 347 - 363
  • [26] On the Capacity-Achieving Scheme and Capacity of 1-Bit ADC Gaussian-Mixture Channels
    Rahman M.H.
    Ranjbar M.
    Tran N.H.
    Tran, Nghi H. (Nghi.tran@uakron.edu), 1600, European Alliance for Innovation (07):
  • [27] A Capacity-Achieving T-PIR Scheme Based On MDS Array Codes
    Xu, Jingke
    Zhang, Yaqian
    Zhang, Zhifang
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1047 - 1051
  • [28] An Asymptotically Capacity-Achieving Scheme for the Gaussian Multiple-Access Relay Channel
    Abu Al Haija, Ahmad
    Tellambura, Chintha
    2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
  • [29] Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost
    Tian, Chao
    Sun, Hua
    Chen, Jun
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (11) : 7613 - 7627
  • [30] Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost
    Tian, Chao
    Sun, Hua
    Chen, Jun
    ICC 2019 - 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2019,