@inproceedings{1895cab8cbc1444c98c13d2275b8ddaf,
title = "Resolvability in Eγ with applications to lossy compression and wiretap channels",
abstract = "We study the amount of randomness needed for an input process to approximate a given output distribution of a channel in the Eγ distance. A general one-shot achievability bound for the precision of such an approximation is developed. In the i.i.d. setting where γ = exp(nE), a (nonnegative) randomness rate above inf QU:D(Qxπx)≤ED(QXπX) + (QXU) - E is necessary and sufficient to asymptotically approximate the output distribution πX n using the channel QX n, where QU → QXU →QX. The new resolvability result is then used to derive a oneshot upper bound on the error probability in the rate distortion problem; and a lower bound on the size of the eavesdropper list to include the actual message in the wiretap channel problem. Both bounds are asymptotically tight in i.i.d. settings.",
author = "Jingbo Liu and Paul Cuff and Sergio Verdu",
year = "2015",
month = sep,
day = "28",
doi = "10.1109/ISIT.2015.7282556",
language = "English (US)",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "755--759",
booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",
address = "United States",
note = "IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",
}