On functionals satisfying a data-processing theorem

  • Authors:
  • J. Ziv;M. Zakai

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 1973

Quantified Score

Hi-index 754.84

Visualization

Abstract

It is shown that the rate-distortion bound(R(d) leq C)remains true when-log xin the definition of mutual information is replaced by an arbitrary concave(cup)nonincreasing function satisfying some technical conditions. Examples are given showing that for certain choices of the concave functions, the bounds obtained are better than the classical rate-distortion bounds.