Skip to search formSkip to main contentSkip to account menu

Log sum inequality

In mathematics, the log sum inequality is an inequality which is useful for proving several theorems in information theory.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Bayesian inference is a statistical inference technique in which Bayes’ theorem is used to update the probability distribution of… 
2014
2014
We present a new access scheme for the AWGN Multiple Access Channel (MAC). The proposed system is a hybrid scheme consisting of… 
2014
2014
The present communication deals with the development of new coding theorems in terms of channel equivocation, that is, coding is… 
Highly Cited
2012
Highly Cited
2012
The probability hypothesis density (PHD) and multitarget multi-Bernoulli (MeMBer) filters are two leading algorithms that have… 
2010
2010
  • M. Vidyasagar
  • IEEE Conference on Decision and Control
  • 2010
  • Corpus ID: 26301718
In this paper we generalize the familiar notion of the Kullback-Leibler divergence between two probability distribitions on a… 
2009
2009
  • N. Merhav
  • IEEE Transactions on Information Theory
  • 2009
  • Corpus ID: 2051839
We provide a simple physical interpretation, in the context of the second law of thermodynamics, to the information inequality (a… 
2008
2008
The log-sum inequality is used to prove some theoroms in information theory.As a result is pointed out to be deficient and then… 
2006
2006
  • Y. Kai
  • 2006
  • Corpus ID: 124868986
The log-suminequality is used to prove two theorems in information theory.As a result is pointed out to be deficient and then be… 
Review
1991
Review
1991
Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the…