No title
Generalized low-density parity-check (GLDPC) codes improve the error-correction capability of conventional low-density parity-check (LDPC) codes by replacing single parity-check (SPC) constraints with more powerful component codes. However, stronger local constraints introduce additional redundancy and may reduce the overall code rate. This thesis investigates how the rate of Hamming-based GLDPC c
