Similar Items: An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
- Empirical coordination in the finite blocklength regime: an achievability result---Extended version
- Deterministic identification for Bernoulli channels and related channels with continuous input
- Atomic Hybrid Sparse/Diffuse Channel Estimation and Cramér-Rao Bounds Analysis
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
- Algorithms for Markov Binomial Chains
- Complex Analysis of Channel Polarization on discrete BMS Channels