Generating Random Tanner-graphs with Large Girth

Mohsen Bayati, Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh, and Amin Saberi

Purpose

An implementation of an algorithm to randomly generate Tanner-graphs with given symbol-node and check-node degrees and without small cycles. The algorithm generates a graph by sequentially adding the edges to an ampty graph as described in the paper generating random Tanner-graphs with large girth.

Feedback

Please report bugs or other feedback to Sewoong Oh (swoh AT illinois DOT edu).