arXiv subjects
Publications and source records attributed to Mustafa Kesal.
For the class of the memoryless binary-input channels which are not necessarily symmetric, we derive tight bounds on the capacity in terms of the Bhattacharyya parameter. As it turns out, the bounds derived under the symmetric channel assumption in [1] are valid for the general case as well.
Suppose $\XX{N}$ is a uniformly distributed $N$-dimensional binary vector and $\YY{N}$ is obtained by passing $\XX{N}$ through a binary symmetric channel with crossover probability $α$. Recently, Courtade and Kumar postulates that $I(f(\XX{N});\YY{N})\leq 1-\Be(α)$ for any Boolean function $f$ \cite{courtade}. In this paper, we provide a proof of the correctness of this conjecture.