Efficient Search of Girth-Optimal QC-LDPC Codes

DOI10.1109/TIT.2016.2523979MaRDI QIDQ2976880zbMATH OpenFDO

Authors Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2016.2523979

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(5)

• QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field
• 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
• Integer Ring Sieve for Constructing Compact QC-LDPC Codes With Girths 8, 10, and 12
• On the lifting degree of girth-8 QC-LDPC codes

This page was built for publication: Efficient Search of Girth-Optimal QC-LDPC Codes

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