Abstract: The progressive edge-growth (PEG) algorithm constructs an edge in each stage to maximize the variable node (VN) of interest's local girth in real time. Thus, this VN's local girths, after ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback