Project SherlockEst. Knowledge

Paper

1948

A Mathematical Theory of Communication

Claude Shannon

Defines information quantitatively and proves the limits of compression and error-free transmission over noisy channels.

Before you start

Assumes: probability and logarithms, plus the patience to let the opening pages define everything they use

Groundwork for

Works in the library that name this one as a prerequisite.

Communication Theory of Secrecy SystemsClaude Shannon, 1949Puts cryptography on a mathematical footing and proves the one-time pad is the only perfectly secret cipher.

Filed under Theory of Computation in Computer Science.