Shannon's source coding theorem
Primer teorema de Shannon
- Date
- 1948 · confidence high
- Place
- Murray Hill, New Jersey, United States
- Credited to
- Claude Shannon
- Field
- Knowledge & symbols
What was discovered
Establishes the statistical limit of lossless data compression for a random source, fixing Shannon entropy as the minimum possible code rate without a significant risk of information loss.
What it led to
- Theoretical foundation of every lossless data compression algorithm
- Basis of modern information theory
- Reference for comparing the efficiency of codes such as Huffman or arithmetic coding