Cyclically Symmetric Entropy Inequalities Conference Paper uri icon

abstract

  • 2016 IEEE. A cyclically symmetric entropy inequality is of the form hOchO, 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 cO,O. For two non-empty orbits O and O of a cyclic group, it is said that O dominates O if cO,O = 1. Special attention is paid to characterizing such dominance relationship, and a graphical method is developed for that purpose.

name of conference

  • 2016 IEEE International Symposium on Information Theory (ISIT)

published proceedings

  • 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY

author list (cited authors)

  • Chen, J., Ye, H., Tian, C., Liu, T., & Xiao, Z.

complete list of authors

  • Chen, Jun||Ye, Hao||Tian, Chao||Liu, Tie||Xiao, Zhiqing

publication date

  • January 1, 2016 11:11 AM