2026
CLM-INFO-003219<= E(R) <= E_sp(R) = sup_{rho>=0} [E0(rho)-rho R]UPPER BOUNDThe cited theorem establishes E(R) <= E_sp(R) = sup_{rho>=0} [E0(rho)-rho R] under the current specification; this does not assert universal empirical attainability.Source: Probability of error for optimal codes in a Gaussian channel — Sphere-packing converse for discrete memoryless channels ↗
PROVEN