This work establishes exact strong data-processing (contraction) coefficients for the Jensen–Shannon divergence across symmetric discrete channels. A complete analytic proof shows that, for the binary symmetric channel, the JSD contraction coefficient is exactly \ ( (1-2) ²\), even though the generating function of JSD is not operator convex and standard equivalence theorems are therefore inapplicable. For all \ (m 3\) symmetric channels, we rigorously demonstrate a strict separation between the Jensen–Shannon and \ (²\) contraction coefficients. This identifies the binary symmetric channel as the unique nontrivial symmetric channel family where these coefficients coincide for all noise levels.
Alex B. Shvets (2026) studied this question.