来自源代码的多存取通道可溶性代码 (Multiple Access Channel Resolvability Codes from Source Resolvability Codes)

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 which involves 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.

翻译：我们表明,多入口通道(MAC)可溶性代码构建问题可以简化为源可溶性代码构建的简单问题。具体地说,我们建议采用多源可溶性代码构建一个模块,其中涉及以黑盒方式使用的多种源溶性代码的组合,以及通过散散散散散散散射和块 Markov 编码实施随机循环利用。由于明确的源可溶性代码已经为人所知,我们的结果还产生了第一个明确的编码计划,为任何带有二元输入字母的离散的无内存多入口通道实现MAC整个可溶性区域。