Partition Reduction for Lossy Data Compression Problem

Details Partition Reduction for Lossy Data Compression Problem Partition Reduction for Lossy Data Compression Problem

2012-03-31

arxiv.org/abs/1204.0078v1

Computer Science

Information Theory

Scientific paper

We consider the computational aspects of lossy data compression problem, where the compression error is determined by a cover of the data space. We propose an algorithm which reduces the number of partitions needed to find the entropy with respect to the compression error. In particular, we show that, in the case of finite cover, the entropy is attained on some partition. We give an algorithmic construction of such partition.

Affiliated with

Also associated with

No associations

Rating

Partition Reduction for Lossy Data Compression Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Partition Reduction for Lossy Data Compression Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partition Reduction for Lossy Data Compression Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-655444