Claude Shannon

Contributions in the toolbox

1. 1948

   Publishes the channel-capacity theorem C = B·log₂(1+S/N).

   → Shannon-Hartley Channel Capacity
2. 1948

   Defines information entropy in bits — H = -Σ p log₂ p.

   → Password Entropy (bits)
3. 1948

   Formalizes sampling theory, making sample-timing error a quantifiable noise source.

   → SNR Loss from Sample Jitter
4. 1949

   Sampling theorem formalized.

   → ADC Resolution
5. 1949

   Gives the reconstruction condition its information-theory proof.

   → Nyquist Rate & Aliasing
6. 1949

   Ties sinc reconstruction to the sampling theorem for communications.

   → Sinc Interpolation Error
7. 1949

   Formal proof of the sampling theorem; aliasing gets its mathematical footing.

   → Anti-Alias Filter Attenuation
8. 1951

   Estimates the redundancy of English, foreshadowing weak human passwords.

   → Password Entropy (bits)

← Back to the timeline