3 problems

MSGT list-size conjecture. Substituting $L=\gamma K$ establishes a lower limit for $\gamma$ that guarantees that the MSGT algorithm's error probability is at most that of the maxim…

Let $(d_v,d_c)$-regular LDPC codes have girth $\Omega\left(\log n\right)$, and transmit them over a binary symmetric channel with cross-over probability $p$. Let $p^*$ be the bit-e…

Let $\hat{\mathbf{s}}$, $\hat{\mathbf{s}}_M$, or $\hat{\mathbf{s}}_{\epsilon}$ be approximated by divided decoding with sphere decoding according to a splitting index set…