Strong Data Processing Inequalities and <inline-formula> <tex-math notation="LaTeX">$\Phi $ </tex-math> </inline-formula>-Sobolev Inequalities for Discrete Channels

DOI10.1109/TIT.2016.2549542zbMath1359.94353arXiv1411.3575OpenAlexW2963423396MaRDI QIDQ2976786

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.3575

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Related Items (10)

Complete entropic inequalities for quantum Markov chains ⋮ Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems ⋮ Unnamed Item ⋮ Universal Features for High-Dimensional Learning and Inference ⋮ On lower bounds for the bias-variance trade-off ⋮ Exponential decay of matrix Φ-entropies on Markov semigroups with applications to dynamical evolutions of quantum ensembles ⋮ Matrix Poincaré, Φ-Sobolev inequalities, and quantum ensembles ⋮ Comparison of contraction coefficients for $f$-divergences ⋮ Common Information, Noise Stability, and Their Extensions ⋮ Stability of logarithmic Sobolev inequalities under a noncommutative change of measure

This page was built for publication: Strong Data Processing Inequalities and <inline-formula> <tex-math notation="LaTeX">$\Phi $ </tex-math> </inline-formula>-Sobolev Inequalities for Discrete Channels