A New Bound in Information Theory

被引：0

作者：

Popescu, Mihaela-Alexandra ^{[1
]}

Slusanschi, Emil ^{[2
]}

Iancu, Voichita ^{[2
]}

Pop, Florin ^{[2
]}

机构：

[1] Romanian Acad, Inst Solid Mech, Bucharest, Romania

[2] Univ Politeh Bucharest, Fac Automat Control & Comp, Bucharest, Romania

来源：

2014 ROEDUNET CONFERENCE 13TH EDITION: NETWORKING IN EDUCATION AND RESEARCH JOINT EVENT RENAM 8TH CONFERENCE | 2014年

关键词：

Jensen's inequality; entropy; bounds; refinements;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Shannon Entropy, for discrete-valued random variables, plays important roles in information theory [1], especially for the transmission, processing and storage of information and also in measure theory with major impact to data integration and probabilistic estimation. The purpose of this paper is to present a new bound for the Shannon Entropy, by first developing a refinement of Jensen's inequality. This refinement is applied in order to find a new and more accurate upper bound for Shannon Entropy. Based on this, the paper presents an application to structural complexity analysis of a computer network modeled by a connected graph.

引用

页数：3

共 12 条

[1] [Anonymous], 2006, Elements of Information Theory
[2] [Anonymous], 2012, 318273 LEXNET EU
[3] Diaz-Barrero J. L., 2006, J INEQUALITIES PURE, V7, P1
[4] Some bounds on entropy measures in information theory
Dragomir, SS
Goh, CJ
[J]. APPLIED MATHEMATICS LETTERS, 1997, 10 (03) : 23 - 28
[5] On the convex functions and inequalities between mean values
Jensen, JLWV
[J]. ACTA MATHEMATICA, 1906, 30 (02) : 175 - 193
[6] LALL A, 2006, SIGMETRICS PERFORM E, V34, P145
[7] Munteanu L., 2012, REV ROUMAINE SCI MA, V57, P63
[8] Pfaltz J. L., 2012, ARXIV12122917
[9] Popescu M. A., 2011, INVERSE PROBLEMS COM, V1, P275
[10] New Inequalities between Information Measures of Network Information Content
Popescu, Pantelimon-George
Pop, Florin
Herisanu, Alexandru
Tapus, Nicolae
[J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013

← 1 2 →