ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Cunif(d)C_{\text{unif}}(d) be the maximum coding rate achievable by uniformly-random codes for the binary deletion channel with deletion probability dd, and define

dunif∗:=sup⁡{d∈[0,1]:Cunif(d)>0}.d^*_{\text{unif}}:=\sup\{d\in[0,1]:C_{\text{unif}}(d)>0\}.

Uniform-capacity threshold conjecture.

dunif∗=1.d^*_{\text{unif}}=1.

Equivalently, uniformly-random codes achieve positive rate for every d<1d<1. 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 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.