Cyclically symmetric entropy inequalities
2016 IEEE International Symposium on Information Theory (ISIT)(2016)
摘要
A cyclically symmetric entropy inequality is of the form h
O
≥ch
O′
, where h
O
and h
O′
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.
更多查看译文
关键词
cyclically symmetric entropy inequality,cyclic orbit entropy terms,cyclic group,dominance relationship,graphical method
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要