AITIP (Information Theoretic Inequality Prover) is an online service that automatically proves or disproves information theory inequalities in the form of entropy, joint entropy and mutual information. Such problems are not only important in Information Theory, but they also arise in fields like Machine Learning and Cryptography.
For information inequalities involving more than a handful of random variables, it is tedious and sometimes infeasible to construct the proof or disproof by hand, and our web service automates this process. It can also be used as an educational tool for teaching and learning Information Theory.
For the technical details, please refer to our paper Proving and Disproving Information Inequalities: Theory and Scalable Algorithms published in IEEE Transactions on Information Theory. The complete source code is available on GitHub. A tutorial of the software is published in the IEEE Information Theory Society Newsletter.
@article{ho2020proving,
title={Proving and Disproving Information Inequalities: Theory and Scalable Algorithms},
author={Ho, Siu-Wai and Ling, Lin and Tan, Chee Wei and Yeung, Raymond W},
journal={IEEE Transactions on Information Theory},
volume={66},
number={9},
pages={5522--5536},
year={2020},
publisher={IEEE}
}
Teletraffic Research Centre, University of Adelaide, Australia
PhD Student, Department of Computer Science, City University of Hong Kong
Associate Professor, Department of Computer Science, City University of Hong Kong
Choh-Ming Li Professor, Department of Information Engineering, Chinese University of Hong Kong