Quasi-cyclic LDPC codes with high girth
Christian Spagnol, Marta Rossi, Massimiliano Sala · arXiv (Cornell University) · 2009
We study a class of quasi-cyclic LDPC codes. We provide precise conditions guaranteeing high girth in their Tanner graph. Experimentally, the codes we propose perform no worse than random LDPC codes with their same parameters, which is a significant achievement for algebraic codes.