Enumerators for protograph ensembles of LDPC codes

Abstract

This paper considers the problem of finding average enumerators for the class of protograph ensembles, which are related in a certain way to quasi-cyclic codes. Our methods, which are necessarily different from those used to compute enumerators for classical irregular ensembles, can be applied to both codeword and stopping set weight enumerators. The method divides codewords into types based on their partial weight enumerator. For each type, an exponent can be computed for the average number of codewords of that type. Maximizing over types of fixed average weight gives the average enumerator which we seek. Although this maximization step is in general difficult because of non-unique local maxima, we can compute it for simple cases. We show that certain ensembles exist which have a linearly growing minimum distance with high probability, while others have at most sublinearly growing minimum distance with high probability.