ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let η∈(0,1)\eta\in(0,1) be an erasure probability, and let BEC(η)\mathsf{BEC}(\eta) denote the binary erasure channel with erasure probability η\eta. Let CpermC_{\mathsf{perm}} denote noisy permutation channel capacity. Capacity conjecture. For any erasure probability η∈(0,1)\eta\in(0,1),

Cperm(BEC(η))=12.C_{\mathsf{perm}}(\mathsf{BEC}(\eta))=\frac{1}{2}.

The endpoint cases are already known: the identity channel at η=0\eta=0 has capacity 11, while the fully erasing channel at η=1\eta=1 has capacity 00; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.