ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let YY be the output of the binary hypercube Gaussian-location channel, let VV denote its binary-hypercube input, and let PYP_Y and PV∣YP_{V\mid Y} be the corresponding distributions and channel. Write ηKL(PY,PV∣Y)\eta_{\mathrm{KL}}(P_Y,P_{V\mid Y}) for the distribution-dependent Kullback–Leibler contraction coefficient, and let SNR\mathrm{SNR} denote the channel's signal-to-noise ratio. Assume SNR≤1\mathrm{SNR}\le 1. Single-round KL contraction conjecture. There is an absolute constant CC such that

ηKL(PY,PV∣Y)≤C SNR.\eta_{\mathrm{KL}}(P_Y,P_{V\mid Y})\le C\,\mathrm{SNR}.

Under this conjecture, for a message MM and side information UU satisfying the setup in the paper with message budget BB, one obtains I(V;M∣U)≤C SNR⋅BI(V;M\mid U)\le C\,\mathrm{SNR}\cdot B; equivalently, the single-round case T=1T=1 of the target inequality holds with C⋆(d)=CC_\star(d)=C and no polylogarithmic factor. The conjecture is presented as the missing bound needed to turn the KL strong data-processing implication into the desired single-round product bound; its resolution is not supplied here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.