5 papers
Automated Proving of Shannon-Type Entropy Inequalities via Fine-Tuned Language Models and Guided Tree Search
Shing Yin Wong, Shaocheng Liu, Linqi Song +2
Proving Shannon-type entropy inequalities is a fundamental task in information theory that often requires constructing non-trivial linear combinations of known constraints, which i…
A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding
Cheuk Ting Li
Probabilistic settings (e.g., vanishing-error channel coding) and non-probabilistic settings (e.g., zero-error channel coding and adversarial channels) were considered two related…
One-Cold Poisson Channel: A Simple Continuous-Time Channel with Zero Dispersion
Cheuk Ting Li
We introduce the one-cold Poisson channel (OCPC), where the transmitter chooses one of several frequency bands to attenuate at a time. In particular, the perfect OCPC, where the nu…
Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra
Cheuk Ting Li
We propose using confusion hypergraph (hyperconfusion) as a model of information. In contrast to the conventional approach using random variables, we can now perform conjunction, d…
New Second-Order Achievability Bounds for Coding with Side Information via Type Deviation Convergence
Xiang Li, Cheuk Ting Li
We propose a framework for second-order achievability, called type deviation convergence, that is generally applicable to settings in network information theory, and is especially…