Kraft–McMillan Equality: Conservation Law for Complete Prefix-Free Codes — E8 Intelligence Research

FINDING: The Kraft–McMillan inequality is the exact boundary condition for uniquely decodable codes, and its equality case corresponds to complete (maximally compact) prefix-free codes — a discrete analogue of a conservation law. | MATH: For a D-ary code with codeword lengths \(l_i\), the inequality is \(∑_i D-l_i ≤ 1\). Equality \(∑_i D-l_i = 1\) holds iff the code is *complete* (no unused leaves in the D-ary tree). For \(D=2\), the equality can be rewritten as \(∑_i 2-l_i = 1\). The golden ratio appears when \(D = φ^2 = 2.618...\) (or \(D = φ\) with a non-integer alphabet), giving \(∑_i φ-2l_i = 1\) — a self-similar, fractal Kraft sum. The paper on permutation codes generalizes this to \(∑π ∏ᵢ q_il_i(π) ≤ 1\) for non-uniform letter probabilities \(q_i\), with equality for complete permutation codes. | CONNECTION: The equality case \(∑_i D-l_i = 1\) is a **discrete harmonic balance** — the tree's leaf measure sums to unity Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com