TY - GEN
T1 - Design of non-binary quasi-cyclic LDPC codes by ACE optimization
AU - Bazarsky, Alex
AU - Presman, Noam
AU - Litsyn, Simon
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84893270427&partnerID=8YFLogxK
U2 - 10.1109/ITW.2013.6691250
DO - 10.1109/ITW.2013.6691250
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84893270427
SN - 9781479913237
T3 - 2013 IEEE Information Theory Workshop, ITW 2013
BT - 2013 IEEE Information Theory Workshop, ITW 2013
T2 - 2013 IEEE Information Theory Workshop, ITW 2013
Y2 - 9 September 2013 through 13 September 2013
ER -