Correct-path survival conjecture for split-reduced successive cancellation list decoding
Statement
A polar code is decoded using a split-reduced successive cancellation list decoder, with denoting the current unfrozen bit and its decoding error probability. Under the Gaussian approximation, consider a correct decoding path that survives through .
Correct-path survival conjecture. As approaches zero, with high probability the current path survives at without splitting and is correctly decoded. If the subsequent subchannels corresponding to 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.