Information theory and channel coding
Defined channel capacity and the limits of reliable communication; every modern modem, mobile and fibre link is engineered against Shannon's bound.
- 1948

First version
Claude E. Shannon (Bell Labs)
Image: AT&T / Bell System · Bell System logo (trademark, copyright expired per Commons note on the 1921 sibling file); unclear for this GIF · Bell System Memorial site via Wayback - 1950

Hamming codes
First practical error-correcting codes.
Image: U.S. Army Photo · Public domain · Wikimedia Commons - 1960

Reed–Solomon codes
Symbol-based codes fix bursts of errors; later protect CDs, QR codes, DSL and satellite TV.
Image: MIT Lincoln Laboratory (design conceived by Carl Overhage, 1958) · © MIT Lincoln Laboratory; trademark, no… · MIT Lincoln Laboratory, 'Lincoln Laboratory Log… - 1967

Viterbi algorithm (convolutional codes)
Maximum-likelihood decoding of convolutional codes; from the 1970s it becomes the workhorse of deep-space probes, then GSM and CDMA phones, dial-up modems and Wi-Fi.
Image: Original: Mik81 Vector: Qef · Public domain · Wikimedia Commons - 1993

Turbo codes
Berrou and Glavieux approach Shannon limit; adopted in 3G and 4G.
Image: Unknown author · Public domain · Wikimedia Commons - 2009

Polar codes
Arıkan's polar codes are the first explicit codes proven to reach channel capacity; 5G uses them for control channels, with LDPC codes for data.
Image: Bilkent University · Trademark of Bilkent University; unclea… · Wayback Machine: bilkent.edu.tr home page of 26…