引入PEG（Progressive-edge-growth）算法来构造适合线性时间编码的LDPC校验矩阵，译码时采用简化最小和Min-Sum译码算法实现简化译码．仿真结果表明，该方法能够构造适合LDPC码的线性时间编码的下三角校验矩阵日，并且用此方法构造的LDPC码性能非常接近原来PEG算法构造的LDPC码．同时通过采用最小和Min-Sum算法降低译码复杂度．,The introduction of PEG (Progressive-edge-growth) algorithm to const

Construct the short length of QC LDPC codes without girth 4 and girth 6-The Program to construct the short length of QC LDPC codes without girth 4 and girth 6 Copyright (C) Yang XIAO, Jun FAN, BJTU, July 26, 2007, E-Mail: yxiao@bjtu.edu.cn.

Quasi-Cyclic：LDPC 码的新进展-Quasi-Cyclic: LDPC codes New Progress

Construction of Regular Quasi-Cyclic Protograph LDPC Codes Based on Vandermonde Matrices