Multiple Access Channel Resolvability Codes From Source Resolvability Codes

被引:0
|
作者
Sultana, Rumia [1 ]
Chou, Remi A. [1 ]
机构
[1] Wichita State Univ, Dept Elect Engn & Comp Sci, Wichita, KS 67260 USA
关键词
Codes; Encoding; Transmitters; Recycling; Polar codes; Hash functions; Stress; Multiple access channel (MAC); resolvability; randommess recycling; two-universal hash functions;
D O I
10.1109/TIT.2022.3150754
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We show that the problem of code construction for multiple access channel (MAC) resolvability can be reduced to the simpler problem of code construction for source resolvability. Specifically, we propose a MAC resolvability code construction that relies on a combination of multiple source resolvability codes, used in a black-box manner, and leverages randomness recycling implemented via distributed hashing and block-Markov coding. Since explicit source resolvability codes are known, our results also yield the first explicit coding schemes that achieve the entire MAC resolvability region for any discrete memoryless multiple-access channel with binary input alphabets.
引用
收藏
页码:3608 / 3619
页数:12
相关论文
共 50 条
  • [1] Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes
    Sultana, Rumia
    Chou, Remi A.
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1576 - 1580
  • [2] Explicit Low-complexity Codes for Multiple Access Channel Resolvability
    Sultana, Rumia
    Chou, Remi A.
    [J]. 2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 116 - 123
  • [3] Low-Complexity Channel Resolvability Codes for the Symmetric Multiple-Access Channel
    Chou, Remi A.
    Bloch, Matthieu R.
    Kliewer, Jorg
    [J]. 2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 466 - 470
  • [4] Multiple-Access Channel Resolvability with Cribbing
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2052 - 2056
  • [5] Resolvability theory for the multiple-access channel
    Steinberg, Y
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) : 472 - 487
  • [6] Channel Resolvability Codes Based on Concatenation and Sparse Linear Encoding
    Amjad, Rana Ali
    Kramer, Gerhard
    [J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2111 - 2115
  • [7] Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (09) : 5429 - 5447
  • [8] Resolvability of the Multiple Access Channel with Two-Sided Cooperation
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 990 - 994
  • [9] Strong Secrecy From Channel Resolvability
    Bloch, Matthieu R.
    Laneman, J. Nicholas
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) : 8077 - 8098
  • [10] On Channel Resolvability in Presence of Feedback
    Parizi, Mani Bastani
    Telatar, Emre
    [J]. 2016 54TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2016, : 78 - 85