An Automated Theorem Proving Framework for Information-Theoretic Results
Publication in refereed journal
Full Text
Digital Object Identifier (DOI) DOI for CUHK Users |
Altmetrics Information
.
Other information
AbstractWe present a versatile automated theorem proving framework capable of automated discovery, simplification and proofs of inner and outer bounds in network information theory, deduction of properties of information-theoretic quantities (e.g. Wyner and Gács-Körner common information), and discovery of non-Shannon-type inequalities, under a unified framework. Our implementation successfully generated proofs for 32 out of 56 theorems in Chapters 1-14 of the book Network Information Theory by El Gamal and Kim. Our framework is based on the concept of existential information inequalities, which provides an axiomatic framework for a wide range of problems in information theory.
Acceptance Date09/07/2023
All Author(s) ListCheuk Ting Li
Journal nameIEEE Transactions on Information Theory
Year2023
Month11
Volume Number69
Issue Number11
PublisherIEEE
Pages6857 - 6877
ISSN0018-9448
eISSN1557-9654
LanguagesEnglish-United States