We estimate the number of errors corrected by ensembles of codes on graphs (generalized LDPC codes) under low-complexity iterative decoding algorithms.