Multiple Access Channel Resolvability Codes from Source Resolvability Codes

2021/03/18 by Rumia Sultana, Rémi A. Chou, Sultana, Rumia +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Image and Video Retrieval Techniques #Algorithms and Data Compression #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.2103.10430

openalex publication_date 2021/03/18 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28

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.

Related

• Construction of Multiple Access Channel Codes Based on Hash Property
• Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel
• The MAC Resolvability Region, Semantic Security and Its Operational Implications
• Channel Resolvability Using Multiplicative Weight Update Algorithm
• A New Achievable Rate Region for Multiple-Access Channel with States