. M. Bibliography-[-tanner99-]-r and . Tanner, On quasi-cyclic repeat-accumulate codes, Proc. of. the 37 th Allerton Conference, 1999.

F. D. Forney, Codes on graphs : Normal realizations, IEEE Transactions on Information Theory, 2001.
DOI : 10.1109/isit.2000.866299

T. Chung, R. Richardson, and . Urbanke, Analysis of sum-product decoding of low-density parity-check codes using a gaussian approximation, IEEE Transactions on Information Theory, vol.47, 2001.

E. Hu, D. Eleftheriou, and . Arnold, Progressive edge-growth tanner graphs, IEEE Global Telecommunications Conference, vol.2, 2001.

[. Richardson, A. Shokrollahi, and R. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, IEEE Transactions on Information Theory, vol.47, issue.2, 2001.
DOI : 10.1109/18.910578

]. Tian03, C. Tian, J. D. Jones, and R. D. Villasenor, Construction of irregular LDPC codes with low error floors, IEEE International Conference on Communications, 2003.

[. Richardson, Error floors of LDPC codes, 41st Annual Allerton Conferenceon Communications, Control, and Computing, 2003.