Joint Channel Coding and Intrinsic Randomness

• UYEMATSU Tomohiko

  Dept. of Information and Communications Engineering, Tokyo Institute of Technology

• MATSUTA Tetsunao

  Dept. of Information and Communications Engineering, Tokyo Institute of Technology

Abstract

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.

Journal

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A (12), 2091-2098, 2018-12-01

  The Institute of Electronics, Information and Communication Engineers

Keywords

• achievable rate region
• channel coding
• channel intrinsic randomness
• general channel
• joint channel coding and intrinsic randomness

Details

• CRID: 1390845713026548864
• NII Article ID: 130007539059
• DOI: 10.1587/transfun.e101.a.2091
• ISSN: 17451337
• ISSN: 09168508
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E101.A/12/E101.A_2091/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed