Book contents
- Frontmatter
- Contents
- Preface
- Abbreviations
- 1 Introduction
- 2 Basics
- 3 Erasure Channel Models and Bounds
- 4 Low-Density Parity-Check Codes
- 5 Weight Distribution and Minimum Distance of LDPC Codes
- 6 Iterative and Maximum-Likelihood Decoding of LDPC Codes
- 7 Iterative LDPC Decoder Analysis
- 8 Maximum-Likelihood LDPC Decoder Analysis
- 9 Low-Density Parity-Check Codes: Generalizations
- 10 Polar Codes
- 11 Fountain Codes
- Appendix A Applications of Erasure Codes
- Appendix B Random Matrices over Finite Fields
- Index
- References
9 - Low-Density Parity-Check Codes: Generalizations
Published online by Cambridge University Press: aN Invalid Date NaN
Book contents
- Frontmatter
- Contents
- Preface
- Abbreviations
- 1 Introduction
- 2 Basics
- 3 Erasure Channel Models and Bounds
- 4 Low-Density Parity-Check Codes
- 5 Weight Distribution and Minimum Distance of LDPC Codes
- 6 Iterative and Maximum-Likelihood Decoding of LDPC Codes
- 7 Iterative LDPC Decoder Analysis
- 8 Maximum-Likelihood LDPC Decoder Analysis
- 9 Low-Density Parity-Check Codes: Generalizations
- 10 Polar Codes
- 11 Fountain Codes
- Appendix A Applications of Erasure Codes
- Appendix B Random Matrices over Finite Fields
- Index
- References
Summary
Generalizations of LDPC codes: In Chapter 9, we present code ensembles that may be regarded as special instances, generalization, or modifications of LDPC code ensembles introduced in Chapter 4. This chapter starts with spatially coupled LDPC codes, introduced within a protograph-based framework, then addresses generalized LDPC codes, where some of the CNs impose multiple linear constraints, and finally describes low-density generator matrix codes. Erasure decoding algorithms are described for all code classes.
Information
- Type
- Chapter
- Information
- Coding for Erasure Channels , pp. 228 - 268Publisher: Cambridge University PressPrint publication year: 2026
References
Jiménez Felström, A. and Zigangirov, K. S., “Time-varying periodic convolutional codes with low-density parity-check matrix,” IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2181–2191, Sep. 1999.10.1109/18.782171CrossRefGoogle Scholar
Tanner, R. M., Sridhara, D., Sridharan, A., Fuja, T. E., and Costello, D. J., “LDPC block and convolutional codes based on circulant matrices,” IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 2966–2984, Dec. 2004.10.1109/TIT.2004.838370CrossRefGoogle Scholar
Lentmaier, M., Sridharan, A., Costello, D. J., and Zigangirov, K. S., “Iterative decoding threshold analysis for LDPC convolutional codes,” IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5274–5289, Oct. 2010.CrossRefGoogle Scholar
Kudekar, S., Richardson, T. J., and Urbanke, R. L., “Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC,” IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 803–834, Feb. 2011.CrossRefGoogle Scholar
Andriyanova, I. and Graell i Amat, A., “Threshold saturation for nonbinary SC-LDPC codes on the binary erasure channel,” IEEE Trans. Inf. Theory, vol. 62, no. 5, pp. 2622–2638, May 2016.10.1109/TIT.2016.2540800CrossRefGoogle Scholar
Mitchell, D. G. M., Lentmaier, M., and Costello, D. J., “Spatially coupled LDPC codes constructed from protographs,” IEEE Trans. Inf. Theory, vol. 61, no. 9, pp. 4866–4889, Sep. 2015.CrossRefGoogle Scholar
Iyengar, A. R., Papaleo, M., Siegel, P. H., Wolf, J. K., Vanelli-Coralli, A., and Corazza, G. E., “Windowed decoding of protograph-based LDPC convolutional codes over erasure channels,” IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2303–2320, Apr. 2012.CrossRefGoogle Scholar
Iyengar, A. R., Siegel, P. H., Urbanke, R. L., and Wolf, J. K., “Windowed decoding of spatially coupled codes,” IEEE Trans. Inf. Theory, vol. 59, no. 4, pp. 2277–2292, Apr. 2013.10.1109/TIT.2012.2231465CrossRefGoogle Scholar
Wei, L., Mitchell, D. G. M., Fuja, T. E., and Costello, D. J., “Design of spatially coupled LDPC codes over GF(q) for windowed decoding,” IEEE Trans. Inf. Theory, vol. 62, no. 9, pp. 4781–4800, Sep. 2016.10.1109/TIT.2016.2567638CrossRefGoogle Scholar
Tanner, M., “A recursive approach to low complexity codes,” IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533–547, Sep. 1981.10.1109/TIT.1981.1056404CrossRefGoogle Scholar
Sipser, M. and Spielman, D., “Expander codes,” IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710–1722, Nov. 1996.CrossRefGoogle Scholar
Lentmaier, M. and Zigangirov, K. S., “On generalized low-density parity-check codes based on Hamming component codes,” IEEE Commun. Lett., vol. 3, no. 8, pp. 248–250, 1999.10.1109/4234.781010CrossRefGoogle Scholar
Boutros, J., Pothier, O., and Zemor, G., “Generalized low density (Tanner) codes,” in Proc. IEEE Int. Conf. Commun., vol. 1, Vancouver, Canada, June 1999, pp. 441–445.Google Scholar
Xu, J., Chen, L., Zeng, L., Lan, L., and Lin, S., “Construction of low-density parity-check codes by superposition,” IEEE Trans. Commun., vol. 53, no. 2, pp. 243–251, Feb. 2005.CrossRefGoogle Scholar
Liva, G., Ryan, W. E., and Chiani, M., “Quasi-cyclic generalized LDPC codes with low error floors,” IEEE Trans. Commun., vol. 56, no. 1, pp. 49–57, Jan. 2008.CrossRefGoogle Scholar
Miladinovic, N. and Fossorier, M. P. C., “Generalized LDPC codes and generalized stopping sets,” IEEE Trans. Commun., vol. 56, no. 2, pp. 201–212, Feb. 2008.10.1109/TCOMM.2008.041077CrossRefGoogle Scholar
Ashikhmin, A., Kramer, G., and ten Brink, S., “Extrinsic information transfer functions: Model and erasure channel properties,” IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657–2673, Nov. 2004.CrossRefGoogle Scholar
Lentmaier, M., Tavares, M. B. S., and Fettweis, G. P., “Exact erasure channel density evolution for protograph-based generalized LDPC codes,” in Proc. IEEE Int. Symp. Inf. Theory, Seoul, South Korea, June/July 2009, pp. 566–570.Google Scholar
Paolini, E., Fossorier, M. P. C., and Chiani, M., “Doubly-generalized LDPC codes: Stability bound over the BEC,” IEEE Trans. Inf. Theory, vol. 55, no. 3, pp. 1027–1046, Mar. 2009.CrossRefGoogle Scholar
Paolini, E., Fossorier, M. P. C., and Chiani, M., “Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel,” IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1651–1672, Apr. 2010.10.1109/TIT.2010.2040938CrossRefGoogle Scholar
Flanagan, M. F., Paolini, E., Chiani, M., and Fossorier, M. P. C., “On the growth rate of the weight distribution of irregular doubly generalized LDPC codes,” IEEE Trans. Inf. Theory, vol. 57, no. 6, pp. 3721–3737, June 2011.CrossRefGoogle Scholar
Flanagan, M. F., Paolini, E., Chiani, M., and Fossorier, M. P. C., “Spectral shape of doubly-generalized LDPC codes: Efficient and exact evaluation,” IEEE Trans. Inf. Theory, vol. 59, no. 11, pp. 7212–7228, Nov. 2013.10.1109/TIT.2013.2262494CrossRefGoogle Scholar
Olmos, P. M., Mitchell, D. G. M., and Costello, D. J., “Analyzing the finite-length performance of generalized LDPC codes,” in Proc. 2015 IEEE Int. Symp. Inf. Theory, Hong Kong, China, June 2015, pp. 2683–2687.Google Scholar
Häger, C., Pfister, H. D., A. Graell i Amat, and F. Brännström, “Density evolution for deterministic generalized product codes on the binary erasure channel at high rates,” IEEE Trans. Inf. Theory, vol. 63, no. 7, pp. 4357–4378, July 2017.10.1109/TIT.2017.2689783CrossRefGoogle Scholar
Liu, Y., Olmos, P. M., and Koch, T., “A probabilistic peeling decoder to efficiently analyze generalized LDPC codes over the BEC,” IEEE Trans. Inf. Theory, vol. 65, no. 8, pp. 4831–4853, Aug. 2019.CrossRefGoogle Scholar
Garcia-Frias, J. and Zhong, Wei, “Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix,” IEEE Commun. Lett., vol. 7, no. 6, pp. 266–268, June 2003.10.1109/LCOMM.2003.813816CrossRefGoogle Scholar
Forney, G. D., “Codes on graphs: Duality and MacWilliams identities,” IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1382–1397, Mar. 2011.10.1109/TIT.2011.2104994CrossRefGoogle Scholar
Luby, M., Mitzenmacher, M., Shokrollahi, A., and Spielman, D., “Efficient erasure correcting codes,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569–584, Feb. 2001.CrossRefGoogle Scholar
Hsu, C. and Anastasopoulos, A., “Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding,” IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 992–1006, Mar. 2010.10.1109/TIT.2009.2039084CrossRefGoogle Scholar
Accessibility standard: WCAG 2.2 A
Why this information is here
This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.Accessibility Information
The PDF of this book
complies with version 2.2 of the
Web Content Accessibility Guidelines
(WCAG), offering more comprehensive accessibility measures for a broad range
of users and meets the basic
(A)
level of WCAG compliance, addressing essential accessibility barriers.
Content Navigation
Table of contents navigation
Allows you to navigate directly to chapters, sections, or non‐text items through a linked table of contents, reducing the need for extensive scrolling.
Allows you to navigate directly to chapters, sections, or non‐text items through a linked table of contents, reducing the need for extensive scrolling.
Index navigation
Provides an interactive index, letting you go straight to where a term or subject appears in the text without manual searching.
Provides an interactive index, letting you go straight to where a term or subject appears in the text without manual searching.
Reading Order & Textual Equivalents
Single logical reading order
You will encounter all content (including footnotes, captions, etc.) in a clear, sequential flow, making it easier to follow with assistive tools like screen readers.
You will encounter all content (including footnotes, captions, etc.) in a clear, sequential flow, making it easier to follow with assistive tools like screen readers.
Short alternative textual descriptions
You get concise descriptions (for images, charts, or media clips), ensuring you do not miss crucial information when visual or audio elements are not accessible.
You get concise descriptions (for images, charts, or media clips), ensuring you do not miss crucial information when visual or audio elements are not accessible.