Low-Density Parity-Check (LDPC) Codes Constructed from Protographs

By Jeremy Thorpe. 2003

738 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/8be2b16d146c185996692ffb5802929ba1490e9d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Marco Chiani
2. Dariush Divsalar
3. S. Dolinar
4. Kenneth S. Andrews
5. Gianluigi Liva
6. Christopher R. Jones
7. Yury Polyanskiy
8. Li Ping

Citations in the corpus

• Protograph LDPC Codes Design Based on EXIT Analysis (2007, background): “Note that a similar density evolution approach was suggested in [5].”
• Capacity-approaching protograph codes (2009, background): “A protograph [12], or projected graph [13], is a Tanner graph with a relatively small number of nodes.”
• Iterative Decoding Threshold Analysis for LDPC Convolutional Codes (2010, unknown): “They can be interpreted as protographs [25] for the ensembles with larger M , whose Tanner graphs can be obtained from the graphs in Fig.”