Critical Behavior in Lossy Source Coding

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 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.
2 figures

Keywords

Probability, Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134034

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0009018
 http://arxiv.org/abs/math/0009018

Collections

arXiv