Igal Sason. Lower bounds on the graphical complexity of finite-length LDPC codes. In IEEE International Symposium on Information Theory, ISIT 2009, June 28 - July 3, 2009, Seoul, Korea, Proceedings. pages 219-223, IEEE, 2009. [doi]
Abstract is missing.