Approximate minimum path-metric conjecture for SCL decoding with list size at least 8
Statement
Let with , and let denote the log-likelihood ratio at bit position . For each , let be the path metric of the path beginning with and continuing with , and let be the corresponding aggregate path metric. Approximate minimum path-metric conjecture. When , we assume
This extends the preceding approximation to successive cancellation list decoding with and is used to estimate decoding performance. The supplied text gives no evidence that the conjecture has been proved or disproved.
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.