Approximate minimum path-metric conjecture for SCL decoding with list size at least 8
Let L=2mL=2^mL=2m with m≥3m\ge 3m≥3, and let Lk−m{{\mathsf L}_{k-m}}Lk−m denote the log-likelihood ratio at bit position k−mk-mk−m. For each vk−m+1k∈{0,1}m{\bf v}_{k-m+1}^k\in\{0,1\}^mvk−m+1k∈{0,1}m, let…