Quasi-cyclic LDPC codes with high girth

Abstract

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.

References in corpus (1)

• Shortened Array Codes of Large Girth

Cited by in corpus (1)

• Binary Representaion for Non-binary LDPC Code with Decoder Design