Multiple Access Channel Resolvability Codes From Source Resolvability Codes
Multiple Access Channel Resolvability Codes From Source Resolvability Codes
复制标题
DOI：
10.1109/tit.2022.3150754
复制
发表时间：
2021-03
影响因子：
2.5
通讯作者：
Rumia Sultana;Rémi A. Chou
中科院分区：
文献类型：
--
作者：
Rumia Sultana;Rémi A. Chou
我们证明了多址接入信道(MAC)可分解性的码构造问题可以归结为信源可分解性的码构造问题。具体地说，我们提出了一种MAC可解析码的构造，它依赖于以黑盒方式使用的多个源可解析码的组合，并利用通过分布式哈希和块马尔可夫编码实现的随机性循环。由于显式信源可解析码是已知的，因此我们的结果还产生了第一个显式编码方案，对于任何具有二进制输入字母表的离散无记忆多址信道，它们都能达到整个MAC可解域。
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.