New Coding Information Inequalities

2021 ◽  
pp. 337-353
Author(s):  
Ram Naresh Saraswat ◽  
Adeeba Umar
Keyword(s):  
Information Inequalities

scholarly journals New Inequalities between Information Measures of Network Information Content

2013 ◽  
Vol 2013 ◽  
pp. 1-3 ◽  
Author(s):  
Pantelimon-George Popescu ◽  
Florin Pop ◽  
Alexandru Herişanu ◽  
Nicolae Ţăpuş
Keyword(s):  
Information Processing ◽  
Complex Systems ◽  
Complex Networks ◽  
Information Content ◽  
Discrete Case ◽  
Network Information ◽  
Information Inequalities ◽  
Information Measures ◽  
New Inequalities

We refine a classical logarithmic inequality using a discrete case of Bernoulli inequality, and then we refine furthermore two information inequalities between information measures for graphs, based on information functionals, presented by Dehmer and Mowshowitz in (2010) as Theorems 4.7 and 4.8. The inequalities refer to entropy-based measures of network information content and have a great impact for information processing in complex networks (a subarea of research in modeling of complex systems).

Sign in / Sign up

Export Citation Format

Share Document