Design of non-binary quasi-cyclic LDPC codes by ACE optimization

Alex Bazarsky, Noam Presman, Simon Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication2013 IEEE Information Theory Workshop, ITW 2013
DOIs
StatePublished - 2013
Event2013 IEEE Information Theory Workshop, ITW 2013 - Seville, Spain
Duration: 9 Sep 201313 Sep 2013

Publication series

Name2013 IEEE Information Theory Workshop, ITW 2013

Conference

Conference2013 IEEE Information Theory Workshop, ITW 2013
Country/TerritorySpain
CitySeville
Period9/09/1313/09/13

Fingerprint

Dive into the research topics of 'Design of non-binary quasi-cyclic LDPC codes by ACE optimization'. Together they form a unique fingerprint.

Cite this