On the Construction of Structured LDPC Codes Free of Small Trapping Sets

DOI10.1109/TIT.2011.2173733MaRDI QIDQ5272012zbMATH OpenOpenAlexFDO

Authors Nguyen Viet Dung, Shashi Kiran Chilappagari, Michael W. Marcellin, Bane Vasić

Publication date 12 July 2017

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

Full work available at URL https://doi.org/10.1109/tit.2011.2173733

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial codes (94B25)

Recommendations

• On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes
• On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes
• LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing
• QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field
• Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms
• From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
• Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets
• Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets
• Corrections to “On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes” [Sep 14 5188-5203]

Cited in

(6)

• QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field
• Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
• Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers
• Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets
• A combinatorial approach to avoiding weak keys in the BIKE cryptosystem
• Constructions of QC LDPC codes based on integer sequences

This page was built for publication: On the Construction of Structured LDPC Codes Free of Small Trapping Sets

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