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.

翻译：信息测度在线性约束下的信息不等式与恒等式证明是信息论中的一个重要问题。为此，ITIP及其变体算法被开发并实现，这些方法均基于求解线性规划。本文提出了一种符号计算方法。与已知方法相比，我们的方法完全避免了可能引入数值误差的线性规划求解过程，且计算效率更高。