3 problems

Generalized-polygon pseudocodeword-weight conjecture. We conjecture that incidence graphs of generalized $N$-gons yield LDPC codes with $w_{\min}$ very close to $d_{\min}$ and, par…

Type II girth-eight tree-bound conjecture. We conjecture that, in general,

Stronger pseudocodeword weight conjecture. The resulting LDPC code has