Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization
Information Theory
2016-11-17 v2 math.IT
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.
Cite
@article{arxiv.1304.7487,
title = {Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization},
author = {Alex Bazarsky and Noam Presman and Simon Litsyn},
journal= {arXiv preprint arXiv:1304.7487},
year = {2016}
}
Comments
Accepted to 2013 IEEE Information Theory Workshop