2 problems

Let $G$ be a $(c,d,\alpha,\delta)$-bipartite expander and let $C_0\subseteq\mathbb{F}_2^d$ be an inner code with minimum Hamming distance $d(C_0)\ge d_0$. Let…

Stronger pseudocodeword weight conjecture. The resulting LDPC code has