Abstract

For variable-length coding with an almost-sure distortion constraint, Zhang et al. show that for discrete sources the redundancy is upper bounded by log⁡n/n\log n/n and lower bounded (in most cases) by log⁡n/(2n)\log n/(2n), ignoring lower order terms. For a uniform source with a distortion measure satisfying certain symmetry conditions, we show that log⁡n/(2n)\log n/(2n) is achievable and that this cannot be improved even if one relaxes the distortion constraint to be in expectation rather than with probability one.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.