Compression of samplable sources

DOI10.1007/s00037-005-0198-6zbMath1085.68041OpenAlexW2026984671MaRDI QIDQ813316

Luca Trevisan, David Zuckerman, Salil P. Vadhan

Publication date: 8 February 2006

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-005-0198-6

zbMATH Keywords

arithmetic codingpseudorandom generatorsapproximate countingExpander graphsrandomized logspace

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items

Comparing notions of computational entropy ⋮ Resource bounded symmetry of information revisited ⋮ On optimal language compression for sets in PSPACE/poly ⋮ The complexity of estimating min-entropy