@conference {Chou2013,
title = {Data compression with nearly uniform ouput},
booktitle = {Proc. IEEE International Symposium on Information Theory},
year = {2013},
month = {July},
pages = {1979-1983},
address = {Istanbul, Turkey},
abstract = {For any lossless fixed-length compression scheme operating at the optimal coding rate, it is known that the encoder output is not uniform in variational distance, which yet might be desirable in some security schemes. In the case of independent and identically distributed (i.i.d.) sources, uniformity in divergence might be achieved if a uniformly distributed sequence, called seed, of length dn negligible compared to the message length n, is shared between the encoder and the decoder. We show that the optimal scaling of dn that jointly ensures an optimal coding rate and a uniform encoder output in divergence, is roughly on the order of sqrt(n). We also develop a near optimal achievability scheme using invertible extractors.},
issn = {2157-8095},
doi = {10.1109/ISIT.2013.6620572},
author = {R{\'e}mi A Chou and Matthieu R Bloch}
}