text: abstract—we characterize the resolvability region for a large
  class of point-to-point channels with continuous alphabets. in
  our direct result, we prove not only the existence of good
  resolvability codebooks, but adapt an approach based on the
  chernoff-hoeffding bound to the continuous case showing that
  the probability of drawing an unsuitable codebook is doubly
  exponentially small. for the converse part, we show that our
  previous elementary result carries over to the continuous case
  easily under some mild continuity assumption.