M. Popescu, E. Slusanschi, Voichita Iancu, Florin Pop
{"title":"A new bound in information theory","authors":"M. Popescu, E. Slusanschi, Voichita Iancu, Florin Pop","doi":"10.1109/ROEDUNET-RENAM.2014.6955301","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":340048,"journal":{"name":"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROEDUNET-RENAM.2014.6955301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
