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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2018
020406019662018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Secrecy in communication systems is measured herein by the distortion that an adversary incurs. The transmitter and receiver… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
The problem of determining the region of achievable rates and distortions for multiterminal lossy source coding remains unsolved… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In this paper, we consider the separate coding problem for L+1 correlated Gaussian memoryless sources. We deal with the case… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
We propose and develop rate-distortion theory in the Kolmogorov complexity setting. This gives the ultimate limits of lossy… (More)
  • figure 1
Is this relevant?
2002
2002
We formulate quantum rate-distortion theory in the most general setting where classical side information is included in the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Rate-distortion theory is considered for the Shannon cipher system (SCS). The admissible region of cryptogram rateR, key rate Rk… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We study the randomness necessary for the simulation of a random process with given distributions, in terms of the finite… (More)
  • 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… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Let {(X,, Y,J}r= 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes… (More)
  • figure 3
Is this relevant?
Highly Cited
1972
Highly Cited
1972
A&r&-By defining mutual information as a maximum over an appropriate space, channel capacities can be defined as double maxima… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?