Low Density Parity Check Codes, M.I, 1963. ,
Good error-correcting codes based on very sparse matrices, IEEE Transactions on Information Theory, vol.45, issue.2, pp.399-431, 1999. ,
DOI : 10.1109/18.748992
Design of capacity-approaching irregular low-density parity-check codes, IEEE Transactions on Information Theory, vol.47, issue.2, pp.619-637, 2001. ,
DOI : 10.1109/18.910578
The capacity of low-density parity-check codes under message-passing decoding, IEEE Transactions on Information Theory, vol.47, issue.2, pp.599-618, 2001. ,
DOI : 10.1109/18.910577
A recursive approach to low complexity codes, IEEE Transactions on Information Theory, vol.27, issue.5, pp.533-547, 1981. ,
DOI : 10.1109/TIT.1981.1056404
Regular and irregular progressive edge-growth tanner graphs, IEEE Transactions on Information Theory, vol.51, issue.1, pp.386-398, 2005. ,
DOI : 10.1109/TIT.2004.839541
Design of cages with a randomized progressive edge-growth algorithm, IEEE Communications Letters, vol.12, issue.4, pp.301-303, 2008. ,
DOI : 10.1109/LCOMM.2008.071843
URL : https://hal.archives-ouvertes.fr/hal-00521059
Construction of irregular LDPC codes with low error floors, IEEE International Conference on Communications, 2003. ICC '03., p.12421247, 2004. ,
DOI : 10.1109/ICC.2003.1203996
Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes, IEEE Communications Letters, vol.8, issue.12, pp.715-717, 2004. ,
DOI : 10.1109/LCOMM.2004.839612
Differential evolution ? a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, vol.11, issue.4, pp.341-359, 1997. ,
DOI : 10.1023/A:1008202821328