Regular and irregular progressive edge-growth tanner graphs

By Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold. IEEE Transactions on Information Theory, 2005

1,485 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/3fee13ec18ce94f83bbd24bdf08b962a5b2e6466

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

1. David Declercq
2. Marc P. C. Fossorier
3. Charly Poulliat

In Electrical and Electronic Engineering

1. David Declercq
2. Marc P. C. Fossorier
3. Charly Poulliat

In Molecular Biology

1. David Declercq
2. Marc P. C. Fossorier
3. Charly Poulliat

Citations in the corpus

• Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images (2008, methodology): “For our analysis, we assume the knowledge of the structure of the graph GH (randomly designed or optimized using instances of the PEG algorithm [13] or other good construction algorithms [23]).”
• Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ (2007, methodology): “These codes have been designed with the PEG method of [20].”