Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization
Alex Bazarsky, Noam Presman, Simon Litsyn

TL;DR
This paper presents a new algorithm for designing non-binary quasi-cyclic LDPC codes that optimizes the ACE spectrum to achieve low error floors and outperforms existing methods for short to moderate lengths.
Contribution
It introduces a novel edge label selection method for non-binary LDPC codes that enhances their error-floor performance through ACE spectrum control.
Findings
Generated codes with improved error-floor performance
Outperformed existing code construction methods
Effective for short to moderate code lengths over small fields
Abstract
An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low error-floor. The efficiency of the algorithm is demonstrated by generating good codes of short to moderate length over small fields, outperforming codes generated by the known methods.
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.
