Obtaining structured generator matrices for QC-LDPC codes

In this paper we propose an efficient and general method to obtain structured generator matrices for QC-LDPC codes. Moreover, we devote particular attention to the family of fully-connected monomial codes and perform a statistical analysis of their low-weight unavoidable codewords, whose weight gives an upper bound on their minimum distance.