Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
From MaRDI portal
Recommendations
- Regular LDPC codes from semipartial geometries
- scientific article; zbMATH DE number 2063211
- LDPC Codes From Generalized Polygons
- Construction of Irregular LDPC Codes by Quasi-Cyclic Extension
- LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing
- LDPC codes associated with linear representations of geometries
- LDPC code designs, constructions, and unification
- New Classes of Partial Geometries and Their Associated LDPC Codes
- Recursive construction of LDPC codes
- Linear representations of finite geometries and associated LDPC codes
Cited in
(12)- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- Some combinatorial aspects of constructing bipartite-graph codes
- scientific article; zbMATH DE number 2127872 (Why is no real title available?)
- A family of irregular LDPC codes based on optical orthogonal codes
- Recursive construction of LDPC codes
- Regular and irregular progressive edge-growth tanner graphs
- LDPC Codes From Generalized Polygons
- Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights
- Construction of Irregular LDPC Codes by Quasi-Cyclic Extension
- Construction method of structured LDPC code with large girth
- Constructions of QC LDPC codes based on integer sequences
- Regular LDPC codes from semipartial geometries
This page was built for publication: Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548171)