Compression of Samplable Sources

13 years 8 months ago

Download userweb.cs.utexas.edu

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).

Luca Trevisan, Salil P. Vadhan, David Zuckerman

Real-time Traffic

Algorithms | COCO 2004 | Efficient Prefix-free Compression | Samplable Sources |

claim paper

» Extracting Randomness from Samplable Distributions

» On the Compressibility of NP Instances and Cryptographic Applications

» A Symbolic Dynamical System Approach to Lossy Source Coding with Feedforward

» Queue based compression in a twoway relay network

» Data Compression of Correlated NonBinary Sources Using Punctured Turbo Codes

» Compressing quantum mixedstate sources by sending classical information

» Distributed Source Coding with Optimized Irregular Turbo Codes

» Efficient compression and handling of current source model library waveforms

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2004
Where	COCO
Authors	Luca Trevisan, Salil P. Vadhan, David Zuckerman

Comments (0)

Sciweavers

Compression of Samplable Sources

Algorithms | COCO 2004 | Efficient Prefix-free Compression | Samplable Sources |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers