Source Coding Theorem

Quentin Hibon 📧 and Lawrence C. Paulson 📧

October 19, 2016

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This document contains a proof of the necessary condition on the code rate of a source code, namely that this code rate is bounded by the entropy of the source. This represents one half of Shannon's source coding theorem, which is itself an equivalence.


BSD License


Session Source_Coding_Theorem