Shannon source coding theorem

Shannon 1948: i.i.d. source with entropy H per symbol can be losslessly compressed to rate R iff R ≥ H. Foundation of data compression. Achievability via typical-set + universal codes (Lempel-Ziv).