Cyclically Symmetric Entropy Inequalities Conference Paper

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)

authors

• Liu, Tie
• Tian, Chao

published proceedings

• 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY

author list (cited authors)

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

citation count

• 2

complete list of authors

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

publication date

• January 2016

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

keywords

• 10 Reduced Inequalities

Digital Object Identifier (DOI)

• 10.1109/isit.2016.7541709

International Standard Book Number (ISBN) 13

• 9781509018062

start page

• 2299

end page

• 2303

volume

• 2016-August

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fisit.2016.7541709

user-defined tag

• 10 Reduced Inequalities