Noise sets a speed limit, not an accuracy limit.

What you're seeing

The map is every conversation you could try to have over a noisy wire. Along the bottom: how often the wire flips a bit. Up the side: how fast you talk — message bits per use of the channel. The amber curve is Shannon's capacity, C = 1 − H(p), and it cuts the map in two. That curve is the entire theorem. Everything below it is reachable. Everything above it is not. There is nothing else on the map, because nothing else matters.

The bars on the right are not an illustration — they are a working telegraph. Each press of send builds a random codebook, pushes four hundred real message blocks through the noise you chose, and decodes each one by finding the codeword it most resembles. With your dot below the curve, watch the bars as the blocks lengthen: the share of blocks decoded wrong collapses while the rate you talk at stays exactly where it was. You are paying with block length instead — longer waits and more decoding work, never speed.

Now drag your rate above the curve. The same machinery, the same effort, and the bars grow instead of shrink — pressing up against the little red markers, Fano's floor: at that rate and that block length, no code of any design, by anyone, ever, gets its share of wrong blocks under the marker — and the floor itself climbs as the blocks grow. Longer blocks now make things worse. The boundary is not an engineering difficulty. It is a property of the universe's bookkeeping: a channel that flips bits with probability p simply does not contain more than 1 − H(p) bits of room per use.

Before 1948, the assumption was that reliability had one price: speed, paid all the way down. Press the old way to see it — repeat every bit and take the majority. It works, but look where the cyan dots march: straight down the rate axis. Getting a bit's error down to one in a million at a noise of one in five takes fifty-one copies of it — a rate of 0.02, fourteen times below the capacity that Shannon promises at any error you care to name. The pre-Shannon world thought that trade was the law. It was only a failure of imagination.

Two things are worth carrying away. First, the codebooks here are random — nobody designed them, and they still land the theorem — random codebooks are the idea Shannon's own proof runs on. What carries the information is shared structure: the proof script hands the decoder a different random codebook, and even far below capacity it decodes at chance. Second, slide the noise toward one half and watch the whole achievable country close to nothing: a channel that flips half its bits is a coin, and a coin has no room in it for a message of any length.