Progressive edge-growth Tanner graphs
By Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold. GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2001
506 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/d17a2ae1e6a30d602adbe3efee713ea7cc5b25e3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Christopher R. Jones
- S. Dolinar
- Dariush Divsalar
- Kenneth S. Andrews
- Xiao-Yu Hu
- Evangelos Eleftheriou
- Dieter-Michael Arnold
- Richard D. Wesel
In Electrical and Electronic Engineering
- Christopher R. Jones
- S. Dolinar
- Dariush Divsalar
- Kenneth S. Andrews
- Evangelos Eleftheriou
- Xiao-Yu Hu
- Dieter-Michael Arnold
- Richard D. Wesel
Citations in the corpus
- Selective avoidance of cycles in irregular LDPC code construction (2004, background): “Though not explicitly described in [13] and [10], removal of low-degree nodes from a distribution will raise the overall graph EMD, since low-degree nodes cannot substantially increase the EMD of any given cycle.”
- Regular and irregular progressive edge-growth tanner graphs (2005, background): “This approach proves to be favorable if the minimum distance is at a premium , particularly for short block-length and/or high-rate codes [36-38].”
- Capacity-approaching protograph codes (2009, methodology): “10 was lifted by a factor of 4 using progressive edge growth [33] to remove all multiple parallel edges.”