Quasi-cyclic LDPC codes with high girth
Christian Spagnol, Marta Rossi, Massimiliano Sala
TL;DR
This paper investigates quasi-cyclic LDPC codes, establishing conditions for high girth in their Tanner graphs and demonstrating their competitive performance compared to random LDPC codes.
Contribution
It provides precise algebraic conditions for high girth in quasi-cyclic LDPC codes and shows their practical performance is comparable to random codes.
Findings
Codes achieve high girth under specific algebraic conditions
Proposed codes perform similarly to random LDPC codes
Significant for algebraic code design
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Cooperative Communication and Network Coding