On the Girth of (3,L) Quasi-Cyclic LDPC Codes based on Complete Protographs

Sudarsan V. S. Ranganathan, Dariush Divsalar, Richard D. Wesel

We consider the problem of constructing $(3,L)$ quasi-cyclic low-density parity-check (LDPC) codes from complete protographs. A complete protograph is a small bipartite graph with…