Finite-length analysis of LDPC codes with large left degrees
Junan Zhang, Alon Orlitsky · 2003
Extending the results of Proietti et al. (see IEEE Trans. on Information Theory, vol.48, June 2002) we derive a recursion for calculating the average error probability of random bipartite graph ensembles of LDPC codes with large left degrees over erasure channels.