Source Coding

When to Use

Use this skill when working on source-coding problems in information theory.

Decision Tree

1. Source Coding Theorem

   • Minimum average code length >= H(X)
   • Achievable with optimal codes
   • z3_solve.py prove "shannon_bound"

2. Huffman Coding

   • Optimal prefix-free code for known distribution
   • Build tree: combine two least probable symbols
   • Average length: H(X) <= L < H(X) + 1
   • sympy_compute.py simplify "expected_code_length"