4 citations · 5 across the 15 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.IT2026
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…
cs.IT2026
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…
cs.IT2026
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…