Uniform deletion-channel capacity remains positive up to deletion probability one
Statement
Let be the maximum coding rate achievable by uniformly-random codes for the binary deletion channel with deletion probability , and define
Uniform-capacity threshold conjecture.
Equivalently, uniformly-random codes achieve positive rate for every . The conjecture is motivated by the paper's simulation results and is posed after the question of determining the first deletion probability at which the uniformly-random-code capacity becomes zero.
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.