Searchable Compression

The authors are interested in structuring data compression to support efficient searching of information in the compressed data domain. Specifically, by "Searchable" they mean a layered coding such that certain information can be extracted from the compressed bit-stream without requiring complete decoding of all compressed information. The chain rule for entropy provides a natural formulation for describing such a property for the case of a single discrete information source. The distributed lossless coding of correlated information sources is characterized by the Slepian-Wolf admissible rate region.

Provided by: Washington State University Topic: Networking Date Added: Jan 2011 Format: PDF

Find By Topic