1 problem

Consider a protograph ensemble defined by an $m\times n$ protograph parity-check matrix $H$. Let $d$ be the number of non-zero entries in $H$, and let $r:[d]\to[m]$, $c:[d]\to[n]$,…