Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Rate–distortion theory

Known as: RateDistortionTheory, Rate-distortion-theory, RateDistortion theory 
Rate–distortion theory is a major branch of information theory which provides the theoretical foundations for lossy data compression; it addresses… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
  • Yasutada Oohama
  • IEEE Transactions on Information Theory
  • 2005
  • Corpus ID: 15423054
In this paper, we consider the separate coding problem for L+1 correlated Gaussian memoryless sources. We deal with the case… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider a distributed sensor network in which several observations are communicated to the fusion center using limited… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A new multiterminal source coding problem called the CEO problem was presented and investigated by Berger, Zhang, and Viswanathan… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A new rate control scheme is used to calculate the target bit rate for each frame based on a quadratic formulation of the rate… Expand
  • table 1
  • figure 1
  • table 3
  • figure 2
  • table 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We study the randomness necessary for the simulation of a random process with given distributions, on terms of the finite… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The problem is considered of encoding a discrete memoryless source when correlated side information may or may not be available… Expand
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1978
Highly Cited
1978
In this paper we generalize (to nondiscrete sources) the results of a previous paper (Wyner and Ziv, 1976) on source coding with… Expand
  • figure 3
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Let \{(X_{k}, Y_{k}) \}^{ \infty}_{k=1} be a sequence of independent drawings of a pair of dependent random variables X, Y . Let… Expand
Is this relevant?
Highly Cited
1972
Highly Cited
1972
By defining mutual information as a maximum over an appropriate space, channel capacities can be defined as double maxima and… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1971
Highly Cited
1971
 
Is this relevant?