A class of systematic generalized low-density parity-check (GLDPC) codes with zigzag codes as component codes

termed ZS-GLDPC codes

is proposed on the basis of regular low-density generator matrix (LDGM) codes.The proposed codes have linear encoding complexity

and can be decoded by the sum-product algorithm iteratively.The decoding complexity of ZS-GLDPC codes is lower than GLDPC codes with Hamming component codes.Based on the uniform interleaver assumption

a union bound analysis of the bit error probability was presented for ZS-GLDPC codes when Signal-to-Noise Ratio is high.Density evolution using the Gaussian Approximation was used to analyze the convergence thresholds of ZS-GLDPC codes.Simulation results show that the bit error rate of ZS-GLDPC codes is better than or close to LDPC codes and GLDPC codes with Hamming component codes for short and medium code length.