The proof of information inequalities and identities under linear constraints on the information measures is an important problem in information theory. For this purpose, ITIP and other variant algorithms have been developed and implemented, which are all based on solving a linear program (LP). In this paper, we develop a method with symbolic computation. Compared with the known methods, our approach can completely avoids the use of linear programming which may cause numerical errors. Our procedures are also more efficient computationally.
Authors:
Laigang Guo
School of Mathematical Sciences Beijing Normal University Beijing, China.
Email: lgguo@bnu.edu.cn
Raymond W. Yeung
Institute of Network Coding The Chinese University of Hong Kong Hong Kong, China.
Email: whyeung@ie.cuhk.edu.hk
Xiao-Shan Gao
Key Laboratory of Mathematics Mechanization Chinese Academy of Sciences Beijing, China.
Email: xgao@mmrc.iss.ac.cn