ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd be the deletion probability, let CC denote the capacity of the deletion channel, and let X†\mathbb{X}^\dagger denote the input process constructed in the paper. The conjecture. The achievable rate of X†\mathbb{X}^\dagger differs from capacity by a fourth-order term:

I(X†)=C−Θ(d4).I(\mathbb{X}^\dagger)=C-\Theta(d^4).

The preceding analysis establishes only the weaker estimate I(X†)=C−O(d3−ϵ)I(\mathbb{X}^\dagger)=C-O(d^{3-\epsilon}) for every fixed ϵ>0\epsilon>0. Proving the sharper fourth-order approximation would improve the asymptotic characterization of optimal coding for small deletion probability.

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.