On the Minimum Distance of Generalized Spatially Coupled LDPC Codes

Abstract

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of GSC-LDPC codes constructed from a protograph have better iterative decoding thresholds than their block code counterparts, and that, for large termination lengths, their thresholds coincide with the maximum a-posteriori (MAP) decoding threshold of the underlying generalized LDPC block code ensemble. Here we show that, in addition to their excellent iterative decoding thresholds, ensembles of GSC-LDPC codes are asymptotically good and have large minimum distance growth rates.

Submitted to the IEEE International Symposium on Information Theory 2013

References in corpus (1)

• Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC

Cited by in corpus (5)

• A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes
• Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling
• A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC
• On Generalized LDPC Codes for 5G Ultra Reliable Communication
• Construction of Protograph-Based Partially Doped Generalized LDPC Codes