@proceedings {Vellambi2015,
title = {Lossless and Lossy Source Compression with Near-Uniform Outputs: Is Common Randomness Always Required?},
journal = {Proc. IEEE International Symposium on Information Theory},
year = {2015},
month = {June},
pages = {2171-2175},
publisher = {IEEE},
address = {Honk Kong},
abstract = {It is known that a sub-linear rate of source-independent random seed (common randomness) can enable the construction of lossless compression codes whose output is nearly uniform under the variational distance (Chou-Bloch-ISIT{\textquoteright}13). This work uses finite-blocklength techniques to present an alternate proof that for near-uniform lossless compression the seed length has to grow strictly larger than sqrt(n), where n represents the blocklength of the lossless compression code. In the lossy setting, we show the surprising result that a seed is not required to make the encoder output nearly uniform.},
doi = {10.1109/ISIT.2015.7282840},
author = {Badri N. Vellambi and Matthieu R Bloch and R{\'e}mi A Chou and J{\"o}rg Kliewer}
}