Explicit construction of 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
2020-06
Type
Conference paper
Genre
Keywords
Encoding (symbols),Signal encoding
Subjects (LCSH)
Citation
R. Sultana and R. A. Chou, "Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes," 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 2020, pp. 1576-1580
Abstract
We show that the problem of code construction for multiple access channel resolvability can be reduced to the simpler problem of code construction for source resolvability. Specifically, we propose a multiple access channel resolvability coding scheme that involves randomness recycling, implemented via distributed hashing, and block-Markov encoding, where each encoding block is obtained as a combination of several source resolvability codes. Our construction is independent of the way the source resolvability codes are implemented and yields explicit coding schemes that achieve the multiple access channel resolvability region for an arbitrary discrete memoryless multiple access channel whose input alphabets are binary.
Table of Contents
Description
Click on the DOI link to access the article (may not be free).
Publisher
IEEE
Journal
Book Title
Series
2020 IEEE International Symposium on Information Theory (ISIT);
Digital Collection
Finding Aid URL
Use and Reproduction
Archival Collection
PubMed ID
DOI
ISSN
2157-8095