An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low error-floor. The efficiency of the algorithm is demonstrated by generating good codes of short to moderate length over small fields, outperforming codes generated by the known methods.
|Title of host publication||2013 IEEE Information Theory Workshop, ITW 2013|
|State||Published - 2013|
|Event||2013 IEEE Information Theory Workshop, ITW 2013 - Seville, Spain|
Duration: 9 Sep 2013 → 13 Sep 2013
|Name||2013 IEEE Information Theory Workshop, ITW 2013|
|Conference||2013 IEEE Information Theory Workshop, ITW 2013|
|Period||9/09/13 → 13/09/13|