Irregular progressive edge-growth (PEG) Tanner graphs
Xiaoyu Hu, Evangelos S. Eleftheriou, D.-M. Arnold · 2003
A general method for constructing Tanner graphs having a large girth by progressively establishing edges between symbol and check nodes in an edge-by-edge manner, called progressive edge-growth (PEG) construction, is proposed. Such an approach is powerful for generating good regular and irregular LDPC codes of short and moderate block lengths.