Mitchell, David G.M.Martínez Olmos, PabloLentmaier, MichaelCostello, Daniel J.2021-12-092021-12-092021-06Mitchell, D. G. M., Olmos, P. M., Lentmaier, M. & Costello, D. J. (2021). Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling. IEEE Transactions on Information Theory, 67(6), 3708–3723.0018-9448https://hdl.handle.net/10016/33725Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result in improved error floor performance, due to better minimum distance and trapping set properties, at a cost of some increased decoding complexity. In this paper, we study spatially coupled generalized low-density parity-check (SC-GLDPC) codes and present a comprehensive analysis of these codes, including: (1) an iterative decoding threshold analysis of SC-GLDPC code ensembles demonstrating capacity approaching thresholds via the threshold saturation effect; (2) an asymptotic analysis of the minimum distance and free distance properties of SC-GLDPC code ensembles, demonstrating that the ensembles are asymptotically good; and (3) an analysis of the finite-length scaling behavior of both GLDPC block codes and SC-GLDPC codes based on a peeling decoder (PD) operating on a binary erasure channel (BEC). Results are compared to GLDPC block codes, and the advantages and disadvantages of SC-GLDPC codes are discussed.16eng© 2021, IEEE.Generalized LDPC codesSpatially coupled codesIterative decoding thresholdsMinimum distanceFinite length scalingresearch articleTelecomunicacioneshttps://doi.org/10.1109/TIT.2021.3071743open access370863723IEEE Transactions on Information Theory67AR/0000028559