Resolvability on Continuous Alphabets
Information Theory
2019-07-03 v3 math.IT
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.
Cite
@article{arxiv.1801.03964,
title = {Resolvability on Continuous Alphabets},
author = {Matthias Frey and Igor Bjelaković and Sławomir Stańczak},
journal= {arXiv preprint arXiv:1801.03964},
year = {2019}
}
Comments
v2: Corrected inaccuracies in proof of direct part. Statement of Theorem 3 slightly adapted; other results unchanged v3: Extended version of camera ready version submitted to ISIT 2018