News
Abstract: Progressive-edge-growth (PEG) algorithm is known to construct low-density parity-check codes at finite block lengths with very good performance. In this letter, we propose a very simple ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results