Compression of samplable sources

DOI10.1007/S00037-005-0198-6MaRDI QIDQ813316zbMATH OpenOpenAlexFDO

Authors Luca Trevisan, David Zuckerman, Salil Vadhan

Publication date 8 February 2006

Published in Computational Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

approximate countingarithmetic codingExpander graphspseudorandom generatorsrandomized logspace

Mathematics Subject Classification ID

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

Recommendations

• Resource bounded symmetry of information revisited
• Compression and Ranking
• Comparing Notions of Computational Entropy
• Compression and entropy
• Effective entropies and data compression

Cited in

(10)

• On optimal language compression for sets in PSPACE/poly
• Resource bounded symmetry of information revisited
• The complexity of estimating min-entropy
• Sample Compression Schemes for VC Classes
• Compression With Actions
• Interactive compression for product distributions
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
• Communication complexity vs randomness complexity in interactive proofs
• An efficient coding theorem via probabilistic representations and its applications
• Comparing notions of computational entropy

This page was built for publication: Compression of samplable sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813316)