Multiple access channel resolvability codes from source resolvability codes

No Thumbnail Available
Authors
Sultana, Rumia
Chou, Rémi A.
Issue Date
2022-06-01
Type
Conference paper
Language
en_US
Keywords
Codes , Encoding , Transmitters , Recycling , Polar codes , Hash functions , Stress
Research Projects
Organizational Units
Journal Issue
Alternative Title
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.

Description
Click on the DOI link to view this conference paper (may not be free).
Citation
R. Sultana and R. A. Chou, "Multiple Access Channel Resolvability Codes From Source Resolvability Codes," in IEEE Transactions on Information Theory, vol. 68, no. 6, pp. 3608-3619, June 2022, doi: 10.1109/TIT.2022.3150754.
Publisher
IEEE
License
Journal
Volume
Issue
PubMed ID
DOI
ISSN
0018-9448
EISSN