Claude Shannon
Life
A mathematician and engineer whose 1937 thesis applied Boolean algebra to relay switching circuits. His 1948 paper quantified information and established coding limits for noisy channels. Under stated probabilistic conditions and with long codes, rates below capacity can achieve arbitrarily small error probability—not magically error-free communication in every channel.
Decisive moments
Reading relay circuits with Boolean algebra
CambridgeHis MIT thesis represented and simplified switching circuits with logical expressions, connecting earlier relay and logic work into a powerful design method.
A Mathematical Theory of Communication
It unified information, entropy, and channel capacity. Below capacity, sufficiently long codes can make error probability arbitrarily small under the model; this is not a promise that every finite transmission has zero errors.
Conditions for perfect secrecy
He defined when a ciphertext reveals no information about the plaintext. A one-time pad meets the condition only with a secret uniformly random key at least as long as the message and never reused.
If this person hadn't existed
This is a thought experiment about influence, not a verified historical fact.
Beginners can compare the surprise of coin tosses in bits; intermediate learners connect entropy to compression. Advanced learners inspect the hypotheses behind capacity and error-correcting codes, while experts can question both the power and limits of a model that abstracts away meaning.
Influence network
Beyond MathVoyage
Loading…