His ideas were spare and total: that logic is switching, that information is bits, that every message has an irreducible size, and that even a noisy line has a perfect speed limit. This book is what he actually proved — and the famous diagram everyone has seen.
Boolean true/false maps onto electrical on/off — the digital circuit.
the thesisThe atom of information: one answer to one yes/no question.
the unitH — the true, irreducible amount of information in a source.
the measureEvery channel has a top speed for error-free communication.
the limitHe showed circuits of on/off switches can carry out any Boolean logic.
from his 1937 master's thesis
so true/false → open/closed, and digital computing becomes buildable.
+1 every logic gate in every chip you own is a direct descendant of this single insight.
He defined the basic unit of information as a choice between two states.
name bit = binary digit (credited to Tukey)
so any information could be counted in identical units.
+1 like "Twenty Questions," any message can be pinned down by enough well-chosen yes/no answers.
Source → encoder → channel → decoder → receiver, with noise added along the way.
the diagram everyone in the field has seen
so all communication fit one general picture.
+1 he deliberately separated meaning from transmission — engineering the pipe, not the message.
He measured how much information a source really produces — its entropy, H.
idea uncertainty = information
so you know the smallest a message can ever be squeezed.
+1 a predictable source has low entropy — which is exactly why predictable text compresses so well.
No lossless code can shrink a source below its entropy — but you can get arbitrarily close.
result the source coding theorem
so ZIP, MP3-style coding, and all compression have a hard floor.
+1 every "compress this file" tool is racing toward a wall Shannon located in 1948.
Every channel has a capacity C; below it, error-free communication is possible despite noise.
result the noisy-channel coding theorem
so reliability through noise became a provable guarantee.
+1 stunningly, he proved good codes exist long before anyone knew how to build them — the search took decades.
By adding clever redundancy, you can detect and fix corruption automatically.
idea extra bits that reconstruct the lost ones
so CDs skip scratches and spacecraft phone home cleanly.
+1 the photos from probes at the edge of the solar system arrive intact because of this principle.
He also founded the theory of secure communication, proving when a cipher is unbreakable.
work "Communication Theory of Secrecy Systems" (1949)
so cryptography gained a rigorous foundation.
+1 he proved the one-time pad is perfectly secure — the rare cipher that is mathematically unbreakable.
enihundua series · book no. 1 · logic is switching, information is bits, noise has a limit · the math under the digital world