ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a prime-power alphabet size q≥2q\geq2 and a parameter β∈(0,12]\beta\in(0,\frac{1}{2}], define

g0(x)=(x(1−x))β.g_{0}(x)=(x(1-x))^{\beta}.

Let λm\lambda_m denote the mixing-rate quantity used in the source, namely

λm=sup⁡x∈[0,1]g‾1(x)g0(x).\lambda_m=\sup_{x\in[0,1]}\frac{\overline{g}_{1}(x)}{g_{0}(x)}.

Asymptotic mixing-rate conjecture.

lim⁡m→∞1ln⁡mln⁡λm=lim⁡m→∞1ln⁡mln⁡sup⁡x∈[0,1]g‾1(x)g0(x)=−12.\lim_{m\to\infty}\frac{1}{\ln m}\ln\lambda_m =\lim_{m\to\infty}\frac{1}{\ln m}\ln\sup_{x\in[0,1]}\frac{\overline{g}_{1}(x)}{g_{0}(x)} =-\frac{1}{2}.

This is proposed as sufficient to obtain a sequence of inhomogeneous polar codes with near-optimal scaling for fixed qq as mm grows. The source supplies no resolution, so the conjecture remains open.

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.