Binarization and conditional independence for the Renner–Wolf candidate distribution
Statement
Let be the distribution displayed in the source, depending on a parameter . The candidate-distribution binarization conjecture. There exists a value such that, for every binarization channel and , there exists a channel satisfying
for every , where the channels processing and are binarizations. This is proposed as a route to proving that the displayed distribution has zero secret-key rate despite positive intrinsic information; the source does not resolve the conjecture.
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.