Multiple access channel resolvability codes from source resolvability codes
Sultana, Rumia Chou, Rémi
Sultana, Rumia
Chou, Rémi
Citations
Altmetric:
Authors
Other Names
Location
Time Period
Advisors
Original Date
Digitization Date
Issue Date
2022-06-01
Type
Conference paper
Genre
Keywords
Codes,Encoding,Transmitters,Recycling,Polar codes,Hash functions,Stress
Subjects (LCSH)
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.
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.
Table of Contents
Description
Click on the DOI link to view this conference paper (may not be free).
Publisher
IEEE
Journal
IEEE Transactions on Information Theory
Book Title
Series
Digital Collection
Finding Aid URL
Use and Reproduction
Archival Collection
PubMed ID
DOI
ISSN
0018-9448