ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a variable-length feedback code with M=2KM=2^K messages, target error probability PeP_e, expected decoding time E[T]\mathbb{E}[T], rate R‾\overline{R}, channel capacity CC, first-stage reliability quantity C~1\tilde{C}_1, and bounded one-step log-likelihood drift constant C2C_2. For any ϵ>0\epsilon>0, the error-exponent lower-bound conjecture.

−log⁡PeE[T]≥C~1(1−R‾C)+U(ϵ,K,Pe,C,C~1,C2),-\frac{\log P_e}{\mathbb{E}[T]} \geq \tilde{C}_1\left(1-\frac{\overline{R}}{C}\right)+U(\epsilon,K,P_e,C,\tilde{C}_1,C_2),

where

lim⁡K→∞U(ϵ,K,Pe,C,C~1,C2)=oϵ(1).\lim_{K\rightarrow\infty}U(\epsilon,K,P_e,C,\tilde{C}_1,C_2)=o_\epsilon(1).

The bound is intended to follow by combining the likelihood-ratio drift estimates for the two coding stages with the relation between drift and stopping time. The source presents it as a conjectural result because of issues raised after the one-step drift lemma; the supplied text does not establish whether the conjecture has since been resolved.

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.