{"title":"循环对称熵不等式","authors":"Jun Chen, Hao Ye, C. Tian, Tie Liu, Zhiqing Xiao","doi":"10.1109/ISIT.2016.7541709","DOIUrl":null,"url":null,"abstract":"A cyclically symmetric entropy inequality is of the form h<sub>O</sub>≥ch<sub>O'</sub>, where h<sub>O</sub> and h<sub>O'</sub> are two cyclic orbit entropy terms. A computational approach is formulated for bounding the extremal value of c̅, which is denoted by c̅<sub>O,O'</sub>. For two non-empty orbits O and O' of a cyclic group, it is said that O dominates O' if c̅<sub>O,O'</sub> = 1. Special attention is paid to characterizing such dominance relationship, and a graphical method is developed for that purpose.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"15 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Cyclically symmetric entropy inequalities\",\"authors\":\"Jun Chen, Hao Ye, C. Tian, Tie Liu, Zhiqing Xiao\",\"doi\":\"10.1109/ISIT.2016.7541709\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A cyclically symmetric entropy inequality is of the form h<sub>O</sub>≥ch<sub>O'</sub>, where h<sub>O</sub> and h<sub>O'</sub> are two cyclic orbit entropy terms. A computational approach is formulated for bounding the extremal value of c̅, which is denoted by c̅<sub>O,O'</sub>. For two non-empty orbits O and O' of a cyclic group, it is said that O dominates O' if c̅<sub>O,O'</sub> = 1. Special attention is paid to characterizing such dominance relationship, and a graphical method is developed for that purpose.\",\"PeriodicalId\":198767,\"journal\":{\"name\":\"2016 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"15 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2016.7541709\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2016.7541709","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A cyclically symmetric entropy inequality is of the form hO≥chO', where hO and hO' are two cyclic orbit entropy terms. A computational approach is formulated for bounding the extremal value of c̅, which is denoted by c̅O,O'. For two non-empty orbits O and O' of a cyclic group, it is said that O dominates O' if c̅O,O' = 1. Special attention is paid to characterizing such dominance relationship, and a graphical method is developed for that purpose.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
