Critical behavior in lossy source coding
The following critical phenomenon was recently discovered. When a memoryless source is compressed using a variable-length fixed-distortion code, the fastest convergence rate of the (pointwise) compression ratio to R(D) is either O(rootn) or O(log n), We show it is always O(rootn), except for discrete, uniformly distributed sources.
lossy data compression rate-distortion theory redundancy