Strong 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 . Let . Concentration conjecture, strong form. For every ,
The strong form is stated to imply the weak almost-sure concentration conjecture by the paper's convergence lemma and the Borel–Cantelli lemma. Proving it would substantially justify the observed accuracy of the simulation-based estimates.
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.