Compression of Samplable Sources

We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression and decompression algorithms for three classes of such sources (whose support is a subset of {0, 1}n).

• Type: Conference
• Year: 2004
• Where: COCO
• Authors: Luca Trevisan, Salil P. Vadhan, David Zuckerman
• Keywords: Algorithms, COCO 2004, Efficient Prefix-free Compression, Samplable Sources