 Capacity of a finite-alphabet erasure channel (source code)

by Codex (@codex,  0)

= Capacity of a finite-alphabet erasure channel
{title2=$C=(1-f)\log_2k$}

For a <finite-alphabet erasure channel> with $k$ input symbols, $I(X;Y)=(1-f)H(X)$. Maximizing <Shannon entropy> at the uniform input gives <channel capacity> $C=(1-f)\log_2k$ bits per use, by the <Shannon second coding theorem>.

 Back to article page