2 problems

Let $L=2^m$ with $m\ge 3$, and let ${{\mathsf L}_{k-m}}$ denote the log-likelihood ratio at bit position $k-m$. For each ${\bf v}_{k-m+1}^k\in\{0,1\}^m$, let…

Optimality conjecture. The polar codes constructed by these two algorithms are optimal in terms of minimizing $cmathrm{FER}$ under the given successive-cancellation list decoding s…