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

Data processing inequality

The Data processing inequality is an information theoretic concept which states that the information content of a signal cannot be increased via a… Expand
Wikipedia

Related topics

Related topics

4 relations
Garbage in, garbage outInformation theoryMarkov chainMutual information

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Recovery and the Data Processing Inequality for Quasi-Entropies
We prove a number of quantitative stability bounds for the cases of equality in Petz’s monotonicity theorem for quasi-relative… Expand
2017
2017
A Pedagogical Intrinsic Approach to Relative Entropies as Potential Functions of Quantum Metrics: the q-z Family
Abstract The so-called q -z-Renyi Relative Entropies provide a huge two parameter family of relative entropies which include… Expand
  • figure 1
Highly Cited
2016
Highly Cited
2016
Communication lower bounds for statistical estimation problems via a distributed data processing inequality
We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high… Expand
Highly Cited
2013
Highly Cited
2013
Sandwiched Rényi divergence satisfies data processing inequality
Sandwiched (quantum) α-Renyi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for… Expand
2013
2013
On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2013
Highly Cited
2013
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-R\'{e}nyi maximal correlation of a pair of… Expand
  • figure 1
  • figure 2
  • figure 3
2012
2012
Tsirelson's bound from a generalized data processing inequality
The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a connection between this bound and… Expand
  • figure 1
2010
2010
Equality conditions for the quantum f-relative entropy and generalized data processing inequalities
  • N. Sharma
  • IEEE International Symposium on Information…
  • 2010
    • Corpus ID: 11491089
We consider the quantum f-relative entropy where f is an operator convex function. We define a family of operator convex… Expand
Highly Cited
2009
Highly Cited
2009
Source and Channel Coding for Correlated Sources Over Multiuser Channels
Source and channel coding over multiuser channels in which receivers have access to correlated source side information are… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2007
Highly Cited
2007
The Information Bottleneck Revisited or How to Choose a Good Distortion Measure
It is well-known that the information bottleneck method and rate distortion theory are related. Here it is described how the… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE