An algebraic construction of QC-LDPC codes based on powers of primitive elements in a finite field and free of small ETSs

zbMATH Open1488.94116MaRDI QIDQ5124707FDOQ5124707

Authors: Farzane Amirzade, Meysam Alishahi, Mohammad-Reza Sadeghi 

Publication date: 30 September 2020

Recommendations

• QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field
• Recursive construction of \((J,L)\) QC LDPC codes with girth 6
• On the search of smallest QC-LDPC code with girth six and eight
• Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers
• \((7,K)\) girth-8 QC-LDPC codes with an explicit construction

zbMATH Keywords

girthTanner graphelementary trapping setQC-LDPC codes

Mathematics Subject Classification ID

Other types of codes (94B60)

Cited In (2)

• Title not available (Why is that?)
• QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field

This page was built for publication: An algebraic construction of QC-LDPC codes based on powers of primitive elements in a finite field and free of small ETSs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124707)