Minimum distance bounds of irregular QC-LDPC codes and their applications

We consider a design of quasicyclic LDPC codes which have irregular column weights. We derive bit-oriented bound and parity-oriented bound on the minimum distances of irregular quasicyclic codes using a similar technique to Tanner's simple lower bound