Abstract.
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).
-
1.
We show how to compress sources X samplable by logspace machines to expected length H(X) + O(1).
Our next results concern flat sources whose support is in P.
-
2.
If H(X) ≤ k = n − O(log n), we show how to compress to expected length k + polylog(n − k).
-
3.
If the support of X is the witness set for a self-reducible NP relation, then we show how to compress to expected length H(X) + 5.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received 31 December 2004
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Trevisan, L., Vadhan, S. & Zuckerman, D. Compression of Samplable Sources. comput. complex. 14, 186–227 (2005). https://doi.org/10.1007/s00037-005-0198-6
Issue Date:
DOI: https://doi.org/10.1007/s00037-005-0198-6