A family of irregular LDPC codes with low encoding complexity

S.J. Johnson, S.R. Weller
2003 IEEE Communications Letters  
We consider in this letter irregular quasi-cyclic lowdensity parity-check (LDPC) codes derived from difference families. The resulting codes can be encoded with low complexity and perform well when iteratively decoded with the sum-product algorithm.
doi:10.1109/lcomm.2002.808375 fatcat:7cltlwodzjdevi6okqo2x7tcgu