Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,294,034 papers from all fields of science
Search
Sign In
Create Free Account
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)
Create Alert
Alert
Related topics
Related topics
3 relations
Gibbs' inequality
Information theory
Jensen's inequality
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A hybrid digital-analog scheme for the Multiple Access Channel
Mohamed Hassanin
,
J. Garcia-Frías
Annual Conference on Information Sciences and…
2014
Corpus ID: 9004523
We present a new access scheme for the AWGN Multiple Access Channel (MAC). The proposed system is a hybrid scheme consisting of…
Expand
2014
2014
CONTRIBUTION OF CHANNEL EQUIVOCATION FOR THE DEVELOPMENT OF SOURCE CODING THEOREMS
O. Parkash
,
Priyanka Kakkar
2014
Corpus ID: 51847504
The present communication deals with the development of new coding theorems in terms of channel equivocation, that is, coding is…
Expand
2008
2008
The Applications of Log-Sum Inequality in Information Theory
Liu Rui-ying
2008
Corpus ID: 125020955
The log-sum inequality is used to prove some theoroms in information theory.As a result is pointed out to be deficient and then…
Expand
2006
2006
A Note on the Applications of the Log-Sum Inequality in Information Theory
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE