Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers
DOI10.1109/TIT.2008.926319zbMATH Open1322.94109OpenAlexW2142415334MaRDI QIDQ3604781
Bane VasiΔ, Milos IvkoviΔ, Shashi Kiran Chilappagari
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
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
- Analysis of the relation between properties of LDPC codes and the Tanner graph π π
- On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes π π
- Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes π π
- Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes π π
- Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets π π
- 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 π π
- On the Construction of Structured LDPC Codes Free of Small Trapping Sets π π
- On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes π π
- Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms π π
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)
