Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints on the code bits are replaced with generalized constraints (an arbitrary linear code), are a promising class of codes for low-latency communication. The block error rate performance of the GLDPC codes, combined with a complementary outer code, has been shown to outperform a variety of state-of-the-art code and decoder designs with suitable lengths and rates for the 5G ultra-reliable low-latency communication (URLLC) regime. A major drawback of these codes is that it is not known how to construct appropriate polynomial matrices to encode them efficiently. In this paper, we analyze practical constructions of quasi-cyclic GLDPC (QC-GLDPC) codes and show how to construct polynomial generator matrices in various forms. Our approach employs the minors of the polynomial matrix which allows for a formula to compute the rank of any parity-check matrix representing a QC-GLDPC code, and hence, the dimension of any QC-GLDPC code. We also consider mixed QC-GLDPC constructions, where favorable tradeoffs can be found in code rate vs. error correcting performance by only generalizing a proportion of the constraint nodes, and show that our approach extends naturally to these constructions. Finally, we show that by applying double graph-liftings, the code parameters can be improved without affecting the ability to obtain a polynomial generator matrix.