Recently, pseudocodewords of Tanner graphs of LDPC codes have been used to explain the behavior of iterative decoders for these codes. In this paper, finite-length pseudocodeword weight enumerators for protograph-based generalized-LDPC code ensembles are obtained. Then asymptotic results are derived from the finite-length results by letting the block length go to infinity. The asymptotic results allow us to determine whether or not the typical minimum pseudocodeword weight grows linearly with codeword length. We give examples with Hamming component codes.
['Shadi Abu-Surra', 'Dariush Divsalar', 'William E. Ryan']
Ensemble Pseudocodeword Weight Enumerators for Protograph-Based Generalized LDPC Codes