New Bounds of a Measure in Information Theory

被引:0
作者
Popescu, Mihaela-Alexandra [2 ]
Slussanschi, Oana [3 ]
Olteanu, Alexandru-Corneliu [1 ]
Pop, Florin [1 ]
机构
[1] Univ Politehn Bucuresti, Fac Automat Control & Computers, Bucharest, Romania
[2] Romanian Acad, Inst Solid Mech, Bucharest, Romania
[3] Carol Davila Univ Med & Pharm, Fac Dent, Dept Prevent Dent, Bucharest, Romania
来源
2014 IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, 2014 IEEE 6TH INTL SYMP ON CYBERSPACE SAFETY AND SECURITY, 2014 IEEE 11TH INTL CONF ON EMBEDDED SOFTWARE AND SYST (HPCC,CSS,ICESS) | 2014年
关键词
Jensen's inequality; entropy; bounds; refinements;
D O I
10.1109/HPCC.2014.142
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Shannon Entropy, for discrete-valued random variables, plays an important roles in information theory [1], with applicability in cryptography and communication theory. The purpose of this paper is to present a new bound for the Shannon Entropy. For this we first present a refinement of Jensen's inequality.
引用
收藏
页码:927 / 928
页数:2
相关论文
共 11 条
[1]  
[Anonymous], 2006, Elements of Information Theory
[2]   Robust random number generation for peer-to-peer systems [J].
Awerbuch, Baruch ;
Scheideler, Christian .
THEORETICAL COMPUTER SCIENCE, 2009, 410 (6-7) :453-466
[3]  
Cristea V., 2010, LARGESCALE DISTRIBUT
[4]  
Diaz-Barrero J. L., 2006, J INEQUALITIES PURE, V7, P1
[5]   Some bounds on entropy measures in information theory [J].
Dragomir, SS ;
Goh, CJ .
APPLIED MATHEMATICS LETTERS, 1997, 10 (03) :23-28
[6]   On the convex functions and inequalities between mean values [J].
Jensen, JLWV .
ACTA MATHEMATICA, 1906, 30 (02) :175-193
[7]  
Moretti N., 2012, PARIRANDOM ENTROPY D
[8]  
Munteanu L., 2012, REV ROUMAINE SCI MA, V57, P63
[9]  
Popescu M. A., 2011, INVERSE PROBLEMS COM, V1, P275
[10]   New Inequalities between Information Measures of Network Information Content [J].
Popescu, Pantelimon-George ;
Pop, Florin ;
Herisanu, Alexandru ;
Tapus, Nicolae .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013