The capacity conjecture for binary erasure channels
Statement
Let be an erasure probability, and let denote the binary erasure channel with erasure probability . Let denote noisy permutation channel capacity. Capacity conjecture. For any erasure probability ,
The endpoint cases are already known: the identity channel at has capacity , while the fully erasing channel at has capacity ; the conjecture concerns only the intermediate range and is unresolved in the supplied text.
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.