ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A polar code is decoded using a split-reduced successive cancellation list decoder, with uiu_i denoting the current unfrozen bit and Pe(ui)P_e(u_i) its decoding error probability. Under the Gaussian approximation, consider a correct decoding path that survives through u1i−1u_1^{i-1}.

Correct-path survival conjecture. As Pe(ui)P_e(u_i) approaches zero, with high probability the current path survives at uiu_i without splitting and uiu_i is correctly decoded. If the subsequent subchannels corresponding to ui+1Nu_{i+1}^N become increasingly reliable, then the correct path survives until termination without splitting with high probability.

This conjecture concerns the path behavior induced by the proposed split-reduced rule; the paper reports empirical evidence for it, while a quantitative result is difficult because list-decoding pruning couples exponentially many error patterns.

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.