Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers

DOI10.1109/TIT.2008.926319MaRDI QIDQ3604781zbMATH OpenOpenAlexFDO

Authors Milos Ivković, Shashi Kiran Chilappagari, Bane Vasić

Publication date 24 February 2009

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

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Cyclic codes (94B15) Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• On the Construction of Structured LDPC Codes Free of Small Trapping Sets
• 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
• Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes
• Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes
• On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes
• Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes
• Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets
• On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes
• Analysis of the relation between properties of LDPC codes and the Tanner graph

Cited in

(3)

• QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Effective error floor estimation based on importance sampling with the uniform distribution

This page was built for publication: Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers

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