Generating random Tanner-graphs with large girth
Mohsen Bayati, Raghunandan Hulikal Keshavan, Andrea Montanari, Sewoong Oh, Amin Saberi · 2009
We present a simple and efficient algorithm for randomly generating Tanner-graphs with given symbol-node and check-node degrees and without small cycles. These graphs can be used to design high performance low-density parity-check (LDPC) codes. Our algorithm generates a graph by sequentially adding the edges to an empty graph. Recently, these types of sequential methods for counting and random generation have been very successful.