Error Control Coding, Second Edition
Error Control Coding, Second Edition
Convex Optimization
Problems of Information Transmission
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Asymptotic enumeration methods for analyzing LDPC codes
IEEE Transactions on Information Theory
Weight Distribution of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory
Analysis, design, and iterative decoding of double serially concatenated codes with interleavers
IEEE Journal on Selected Areas in Communications
On asymptotic ensemble weight enumerators of multi-edge type codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Hi-index | 0.00 |
For LDPC-like codes such as LDPC, GLDPC, and DGLDPC codes, it is well known that the error floor can be caused by the codewords of small weights or stopping sets of small sizes. In this paper, we investigate the computation of asymptotic weight enumerators such that it becomes a convenient tool to determine a good distribution of code ensembles. In addition, by analyzing the first order approximation, we derive a condition to obtain a negative asymptotic growth rate of the codewords of small linear-sized weights, which is an important constraint for distribution optimization. Also the weight enumerators of turbo and repeat-accumulate codes are investigated. Furthermore, we extend our results to nonbinary DGLDPC codes. Generalization to N-layer and convolutional code based LDPC-like codes are also developed.