Source coding with distortion profile constraints

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In rate-distortion theory, three main types of distortion constraints have been popular: average, pointwise, and excess probability (aka-fidelity). A new setup is proposed here, which is suitable for fixed-length codes and constrains the distribution (profile) of distortions. This is accomplished by imposing multiple constraints on excess-distortion probabilities as well as an optional constraint on average distortion. We show that coding redundancy for compressing discrete memoryless sources is upper-bounded by R2/√n + log n/2n + O(log log n/n) + R4 + o(1) where n is the block length, R2 the second-order coding rate, and R4 a constant. For the special case of coding with a single-fidelity constraint, R2 = √V Q-1() where V is the source rate-dispersion function, and Q is the tail probability of a normal random variable. The upper bound is proved using a random coding scheme and deriving exact asymptotics for the probability of distortion balls with input type dependent radius.

Original languageEnglish (US)
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages5
ISBN (Electronic)9781509040964
StatePublished - Aug 9 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: Jun 25 2017Jun 30 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


Other2017 IEEE International Symposium on Information Theory, ISIT 2017

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Source coding with distortion profile constraints'. Together they form a unique fingerprint.

Cite this