Graph cover ensembles of non-binary protograph LDPC codes

Abstract

This paper introduces a novel class of non-binary graph-based codes, built upon graph covers of non-binary protograph LDPC codes. This new ensemble is more restrictive than previously considered constructions, but in turn is much simpler to design and implement. The simplifications in design allow for the enumeration of codeword weight, trapping set size, stopping set size, and pseudo codeword weights, both as exact quantities in the finite-length regime and as corresponding growth rates in the asymptotic setting. The presented construction and the accompanying enumerations enhance the analytical toolbox of non-binary LDPC codes.

DOI: 10.1109/ISIT.2012.6283972

2 Figures and Tables

Cite this paper

@article{Divsalar2012GraphCE, title={Graph cover ensembles of non-binary protograph LDPC codes}, author={Dariush Divsalar and Lara Dolecek}, journal={2012 IEEE International Symposium on Information Theory Proceedings}, year={2012}, pages={2526-2530} }