# Tag Info

Here's a simpler example. Consider the binary erasure channel which erases its input with probability $1/2$. The channel capacity is $1/2$, so you should be able to send one bit of information by sending two bits on the channel. Or should you? Shannon's theorem only guarantees that for every $\epsilon > 0$, you can send $(1/2-\epsilon) N$ bits of ...