Joint Channel Coding and Intrinsic Randomness

Tomohiko UYEMATSU  Tetsunao MATSUTA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.12   pp.2091-2098
Publication Date: 2018/12/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.2091
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Shannon theory
Keyword: 
achievable rate region,  channel coding,  channel intrinsic randomness,  general channel,  joint channel coding and intrinsic randomness,  

Full Text: PDF(736.7KB)
>>Buy this Article


Summary: 
This paper considers a joint channel coding and random number generation from the channel output. Specifically, we want to transmit a message to a receiver reliably and at the same time the receiver extracts pure random bits independent of the channel input. We call this problem as the joint channel coding and intrinsic randomness problem. For general channels, we clarify the trade-off between the coding rate and the random bit rate extracted from the channel output by using the achievable rate region, where both the probability of decoding error and the approximation error of random bits asymptotically vanish. We also reveal the achievable rate regions for stationary memoryless channels, additive channels, symmetric channels, and mixed channels.