Multiple Access Channel Resolvability Codes from Source Resolvability Codes

TL;DR

This paper introduces a method to construct multiple access channel (MAC) resolvability codes by reducing the problem to source resolvability, enabling explicit schemes that achieve the entire MAC resolvability region for binary input channels.

Contribution

It presents a novel code construction approach for MAC resolvability based on source resolvability codes, incorporating randomness recycling and distributed hashing.

Findings

First explicit coding schemes for MAC resolvability region

Achieves the entire MAC resolvability region for binary input channels

Reduces MAC resolvability to source resolvability problem

Abstract

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.