Lower bounds on the graphical complexity of finite-length LDPC codes.

Igal Sason

Browse the full ISIT paper archive.