The capacity-achieving input distribution for the binomial channel must have support size at least order sqrt(n log log n).
Some extensions of W. Gautschi’s inequalities for the gamma function
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
The capacity-achieving input distribution for the binomial channel must have support size at least order sqrt(n log log n).