The incorrect-path splitting conjecture for polar-code list decoding
Statement
Let be an unfrozen bit in a polar code, and consider any incorrect decoding path that survives at . Under the Gaussian approximation, the path may continue through subsequent unfrozen bits .
Incorrect-path splitting conjecture. Under the Gaussian approximation, for any incorrect path that survives at some unfrozen bit , it will split at some stage within 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.