Uniform random number generation from markov chains: Non-asymptotic and asymptotic analyses

  • Hayashi M
  • Watanabe S
  • 8


    Mendeley users who have this article in their library.
  • 8


    Citations of this article.


In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on the block length. We also characterize the asymptotic behaviors of the large deviation regime and the moderate deviation regime by using our bounds, which implies that our bounds are asymptotically tight in those regimes. We also show the second-order rates of those problems, and derive single letter forms of the variances characterizing the second-order rates. Furthermore, we address the relative entropy rate and the modified mutual information rate for these problems.

Author-supplied keywords

  • Markov Chain
  • Non-Asymptotic Analysis
  • Random Number Generation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Masahito Hayashi

  • Shun Watanabe

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free