Critical Behavior in Lossy Source Coding

Simple item page
dc.creatorDembo, Amir
dc.creatorKontoyiannis, Ioannis
dc.date2000-09-01
dc.date.accessioned2026-07-07T08:17:10Z
dc.date.available2026-07-07T08:17:10Z
dc.descriptionThe 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 the optimal $R(D)$ bits/symbol is either $O(\sqrt{n})$ or $O(\log n)$. We show it is always $O(\sqrt{n})$, except for discrete, uniformly distributed sources.
dc.description2 figures
dc.identifierhttps://arxiv.org/abs/math/0009018
dc.identifierhttp://arxiv.org/abs/math/0009018
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134034
dc.subjectProbability
dc.subjectInformation Theory
dc.titleCritical Behavior in Lossy Source Coding
dc.typetext

Files

Collections

arXiv