ConceptMathematics
Shannon's noiseless coding theorem
Shannon's noiseless coding theorem states that the expected per-symbol length of an optimal encoding function is bounded below and above by the entropy function plus asymptotic terms.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.