Second-order resolvability, intrinsic randomness, and fixed-length source coding for mixed sources: Information spectrum approach

Ryo Nomura, Te Sun Han

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

The second-order achievable asymptotics in typical random number generation problems such as resolvability, intrinsic randomness, and fixed-length source coding are considered. In these problems, several researchers have derived the first-order and the second-order achievability rates for general sources using the information spectrum methods. Although these formulas are general, their computations are quite hard. Hence, an attempt to address explicit computation problems of achievable rates is meaningful. In particular, for i.i.d. sources, the second-order achievable rates have earlier been determined simply by using the asymptotic normality. In this paper, we consider mixed sources of two i.i.d. sources. The mixed source is a typical case of nonergodic sources and whose self-information does not have the asymptotic normality. Nonetheless, we can explicitly compute the second-order achievable rates for these sources on the basis of two-peak asymptotic normality. In addition, extensions of our results to more general mixed sources, such as a mixture of countably infinite i.i.d. sources or Markov sources, and a continuous mixture of i.i.d. sources, are considered.

Original languageEnglish
Article number6289366
Pages (from-to)1-16
Number of pages16
JournalIEEE Transactions on Information Theory
Volume59
Issue number1
DOIs
Publication statusPublished - 2013 Jan 7
Externally publishedYes

    Fingerprint

Keywords

  • Asymptotic normality
  • mixed source
  • random number generation
  • second-order achievability
  • source coding

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this