Asymptotic mixing-rate conjecture for large-alphabet polarizing kernels
Statement
For a prime-power alphabet size and a parameter , define
Let denote the mixing-rate quantity used in the source, namely
Asymptotic mixing-rate conjecture.
This is proposed as sufficient to obtain a sequence of inhomogeneous polar codes with near-optimal scaling for fixed as 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.