Single-round KL contraction conjecture for the binary hypercube Gaussian-location channel
Statement
Let be the output of the binary hypercube Gaussian-location channel, let denote its binary-hypercube input, and let and be the corresponding distributions and channel. Write for the distribution-dependent Kullback–Leibler contraction coefficient, and let denote the channel's signal-to-noise ratio. Assume . Single-round KL contraction conjecture. There is an absolute constant such that
Under this conjecture, for a message and side information satisfying the setup in the paper with message budget , one obtains ; equivalently, the single-round case of the target inequality holds with 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.