Ensemble pseudocodeword weight enumerators for protograph-based generalized LDPC codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Low-floor tanner codes via hamming-node or RSCC-Node doping
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
IEEE Transactions on Information Theory
Pseudocodewords of Tanner Graphs
IEEE Transactions on Information Theory
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
IEEE Transactions on Information Theory
Ensemble pseudocodeword weight enumerators for protograph-based generalized LDPC codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
| Hi-index | 0.00 |
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.