A family of irregular LDPC codes with low encoding complexity

We consider irregular quasi-cyclic low-density 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.