Weak concentration conjecture for deletion-channel trace ambiguity
Statement
Let be uniformly distributed on , let be the output of the binary deletion channel with deletion probability , and let be the set of length- strings compatible with and . Define
Concentration conjecture, weak form. Almost surely,
This conjecture concerns the concentration of the normalized logarithm of the number of compatible inputs for a deletion-channel output. The paper notes that it may not be difficult to prove, while stronger concentration would provide more rigorous control of the simulation-based bounds.
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.