2 problems

Let $\mathcal{C}$ be a type-I projective-geometry LDPC code, and consider its minimal pseudo-codewords that are not codewords. A minimal pseudo-codeword is called low-support, low-…

Let $\mathcal{C}$ be a type-I projective-geometry LDPC code over a projective plane of order $q$, and let $\mathbf{\boldsymbol{\omega}}$ be a minimal pseudo-codeword that is not a…