1 citations · 2 across the 8 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.IT2018
Maximum Likelihood Upper Bounds on the Capacities of Discrete Information Stable Channels
Tongxin Li
Motivated by a greedy approach for generating {\it{information stable}} processes, we prove a universal maximum likelihood (ML) upper bound on the capacities of discrete informatio…
cs.IT2018
Quadratically Constrained Channels with Causal Adversaries
Tongxin Li, Bikash Kumar Dey, Sidharth Jaggi +2
We consider the problem of communication over a channel with a causal jamming adversary subject to quadratic constraints. A sender Alice wishes to communicate a message to a receiv…