2026
CLM-INFO-003208>= R >= H(X)LOWER BOUNDThe cited theorem establishes R >= H(X) under the current specification; this does not assert universal empirical attainability.Source: A Mathematical Theory of Communication — Shannon lossless source-coding entropy floor ↗
PROVEN