ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let uiu_i be an unfrozen bit in a polar code, and consider any incorrect decoding path that survives at uiu_i. Under the Gaussian approximation, the path may continue through subsequent unfrozen bits ui+1,…,uNu_{i+1},\ldots,u_N.

Incorrect-path splitting conjecture. Under the Gaussian approximation, for any incorrect path that survives at some unfrozen bit uiu_i, it will split at some stage within {i+1,i+2,…,N}\{i+1,i+2,\ldots,N\} with high probability.

This conjecture concerns the behavior of incorrect paths in successive-cancellation list decoding. Together with the preceding conjecture about the correct path, it is intended to describe how splitting and pruning affect path survival, but the source provides empirical evidence rather than a proof.

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.