Flexible Construction of Girth-10 Type II QC-LDPC Codes

The program searches for a girth 10 Type II QC-LDPC code given size of sub-matrix, row and column weights. The program offers flexibility in constructing girth-10 type II QC-LDPC codes compared to other algorithms. The program builds a Tanner graph by connecting groups of rows and columns. A connection is made if it does not form less than ten-cycles. The program may fail to find a code given particular parameters. It also does not find the smallest codes compared to other algorithms. Note: Girth-10 type II codes have [1 1;1 2] configuration in their base matrix.