no code implementations • 22 Dec 2020 • Igal Sason
In particular, when the bipartite graph is regular on one side, but it may be irregular in the other, the extended entropy-based proof technique yields the same bound that was conjectured by Kahn (2001) and proved by Sah et al. (2019).
Combinatorics Information Theory Information Theory
no code implementations • 28 Oct 2016 • Igal Sason, Sergio Verdú
This paper considers derivation of $f$-divergence inequalities via the approach of functional domination.
no code implementations • 19 Dec 2012 • Maxim Raginsky, Igal Sason
This monograph focuses on some of the key modern mathematical tools that are used for the derivation of concentration inequalities, on their links to information theory, and on their various applications to communications and coding.
Information Theory Information Theory Probability
