Compression of Samplable Sources
- Luca TrevisanAffiliated withComputer Science Division, U.C. Berkeley Email author
- , Salil VadhanAffiliated withDivision of Engineering and Applied Sciences, Harvard University
- , David ZuckermanAffiliated withDepartment of Computer Science, University of Texas
We show how to compress sources X samplable by logspace machines to expected length H(X) + O(1).
If H(X) ≤ k = n − O(log n), we show how to compress to expected length k + polylog(n − k).
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.
Keywords.Expander graphs arithmetic coding randomized logspace pseudorandom generators approximate counting
- Compression of Samplable Sources
- Open Access
- Available under Open Access This content is freely available online to anyone, anywhere at any time.
Volume 14, Issue 3 , pp 186-227
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Expander graphs
- arithmetic coding
- randomized logspace
- pseudorandom generators
- approximate counting
- Industry Sectors
- Author Affiliations
- 1. Computer Science Division, U.C. Berkeley, 615 Soda Hall, Berkeley, CA, 94720, U.S.A
- 2. Division of Engineering and Applied Sciences, Harvard University, 33 Oxford Street, Cambridge, MA, 02138, U.S.A
- 3. Department of Computer Science, University of Texas, 1 University Station C0500, Austin, TX, 78712, U.S.A