Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes
Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes
复制标题
从源可解析性代码显式构造多访问信道可解析性代码
DOI：
10.1109/isit44484.2020.9174255
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Chou, Remi A.
中科院分区：
文献类型：
--
作者：
Sultana, Rumia;Chou, Remi A.
我们证明了多址信道可分解性的码构造问题可以归结为信源可分解性的码构造问题。具体地说，我们提出了一种涉及随机性循环的多址信道可分辨编码方案，该方案通过分布式散列和块马尔可夫编码来实现，其中每个编码块作为多个源可分辨代码的组合来获得。我们的构造与源可解析码的实现方式无关，并且产生了实现任意离散无记忆多址接入信道的多址接入信道可分辨区域的显式编码方案，该离散无记忆多址接入信道的输入字母表是二进制的。
We show that the problem of code construction for multiple access channel resolvability can be reduced to the simpler problem of code construction for source resolvability. Specifically, we propose a multiple access channel resolvability coding scheme that involves randomness recycling, implemented via distributed hashing, and block-Markov encoding, where each encoding block is obtained as a combination of several source resolvability codes. Our construction is independent of the way the source resolvability codes are implemented and yields explicit coding schemes that achieve the multiple access channel resolvability region for an arbitrary discrete memoryless multiple access channel whose input alphabets are binary.