1. [1] T.J. Richardson, “Error floors of LDPC codes,” Proc. 41st Annu. Allerton Conf. Commun., Contr. Comput., 2003.
2. Regular and irregular progressive edge-growth tanner graphs
3. [3] O. Fainzilber, E. Sharon, and S. Litsyn, “Decreasing error floor in LDPC codes by parity-check matrix extensions,” Proc. IEEE Intern. Symp. Inf. Theory, pp.374-378, Seoul, Korea, June 2009.
4. [4] M. Ivkovic, S.K. Chilappagari, and B. Vasic, “Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers,” IEEE Trans. Inf. Theory, vol.54, no.8, pp.3763-3768, Aug. 2008.
5. [5] E. Cavus and B. Daneshrad, “A performance improvement and error floor avoidance technique for belief propagation decoding of LDPC codes,” Proc. 16th IEEE Int. Symp. on Personal, Indoor and Mobile Radio Commun., pp.3763-3768, Berlin, Germany, Sept. 2005.