We show that the problem of code construction for multiple access channel (MAC) resolvability can be reduced to simpler source resolvability. Specifically, we propose a MAC relies on combination codes, used in black-box manner, and leverages randomness recycling implemented via distributed hashing block-Markov coding. Since explicit codes are known, our results also yield first coding schemes a...

In the user identification (UI) scheme for a multiple-access fading channel based on randomly generated (0, 1, -1)-signature code, previous studies used signature code over noisy adder channel, and only state information (USI) was decoded by decoder. However, considering communication model as compressed sensing process, it is possible to estimate coefficients while identifying users. this stud...