The proof of information inequalities and identities under linear co额nstraints 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). Building on our recent work (Guo et al., 2023), we developed in this paper an enhanced approach for solving this problem. Experimental results show that our new approach improves the time complexity by over 500 times compared with Guo et al. (2023) for the problem studied by Tian (2014).

Publication:

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 71, NO. 4, APRIL 2025

http://dx.doi.org/10.1109/TIT.2025.3531133

Author:

Laigang Guo

the Laboratory of Mathematics and Complex Systems (Ministry of Education), School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China

e-mail: lgguo@bnu.edu.cn

Raymond W. Yeung

the Institute of Network Coding and the Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong

e-mail: whyeung@ie.cuhk.edu.hk

Xiao-Shan Gao

the Key Laboratory of Mathematics Mechanization, Institute of Systems Science, AMSS, Chinese Academy of Sciences, Beijing 100190, China, and also with the School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 101408, China

e-mail: xgao@mmrc.iss.ac.cn