Given the No.of n,m and the symbol-node-degree sequence of the graph, an edge-selection procedure is started

such that the placement of a new edge on the graph has as small as impact on the girth as possible.

Lower and upper bounds on the girth and a lower bound on the minimum distance are derived in terms of parameters of the PEG Tanner graphs.

The algorithm is excellent method for generating both of regular and irregular codes of short and moderate block lengths.

--------------------------------------------------

The graph grows in an edge-by-edge manner, optimizing each local girth.

The fundamental idea is to find the most distant check node then place a new edge connecting the symbol node and this most distant check nod

------------------------------------------------

A randomly constructed Tanner graph guarantees neither a meaningful lower bound on the girth nor the minimum distance.

In contrast, a PEG Tanner graph exhibits some rather elegant properties in terms of girth and minimum distance.