Book contents
- Channel Codes
- Channel Codes
- Copyright page
- Dedication
- Contents
- Detailed Contents
- Preface to the Second Edition
- Acknowledgments (Second Edition)
- Preface to the First Edition
- Acknowledgments (First Edition)
- 1 Coding and Capacity
- 2 Finite Fields, Vector Spaces, Finite Geometries, and Graphs
- 3 Linear Block Codes
- 4 Convolutional Codes
- 5 Low-Density Parity-Check Codes
- 6 Computer-Based Design of LDPC Codes
- 7 Turbo Codes
- 8 Ensemble Enumerators for Turbo and LDPC Codes
- 9 Ensemble Decoding Thresholds for LDPC and Turbo Codes
- 10 Polar Codes
- 11 Finite-Geometry LDPC Codes
- 12 Constructions of LDPC Codes Based on Finite Fields
- 13 LDPC Codes Based on Combinatorial Designs, Graphs, and Superposition
- 14 LDPC Codes for Binary Erasure Channels
- 15 Nonbinary LDPC Codes
- Index
- References
14 - LDPC Codes for Binary Erasure Channels
Published online by Cambridge University Press: 06 March 2025
Book contents
- Channel Codes
- Channel Codes
- Copyright page
- Dedication
- Contents
- Detailed Contents
- Preface to the Second Edition
- Acknowledgments (Second Edition)
- Preface to the First Edition
- Acknowledgments (First Edition)
- 1 Coding and Capacity
- 2 Finite Fields, Vector Spaces, Finite Geometries, and Graphs
- 3 Linear Block Codes
- 4 Convolutional Codes
- 5 Low-Density Parity-Check Codes
- 6 Computer-Based Design of LDPC Codes
- 7 Turbo Codes
- 8 Ensemble Enumerators for Turbo and LDPC Codes
- 9 Ensemble Decoding Thresholds for LDPC and Turbo Codes
- 10 Polar Codes
- 11 Finite-Geometry LDPC Codes
- 12 Constructions of LDPC Codes Based on Finite Fields
- 13 LDPC Codes Based on Combinatorial Designs, Graphs, and Superposition
- 14 LDPC Codes for Binary Erasure Channels
- 15 Nonbinary LDPC Codes
- Index
- References
Summary
Channel coding lies at the heart of digital communication and data storage. Fully updated to include current innovations in the field, including a new chapter on polar codes, this detailed introduction describes the core theory of channel coding, decoding algorithms, implementation details, and performance analyses. This edition includes over 50 new end-of-chapter problems to challenge students and numerous new figures and examples throughout.
The authors emphasize a practical approach and clearly present information on modern channel codes, including polar, turbo, and low-density parity-check (LDPC) codes, as well as detailed coverage of BCH codes, Reed–Solomon codes, convolutional codes, finite geometry codes, and product codes for error correction, providing a one-stop resource for both classical and modern coding techniques.
Assuming no prior knowledge in the field of channel coding, the opening chapters begin with basic theory to introduce newcomers to the subject. Later chapters then begin with classical codes, continue with modern codes, and extend to advanced topics such as code ensemble performance analyses and algebraic LDPC code design.
300 varied and stimulating end-of-chapter problems test and enhance learning, making this an essential resource for students and practitioners alike.
Provides a one-stop resource for both classical and modern coding techniques.
Starts with the basic theory before moving on to advanced topics, making it perfect for newcomers to the field of channel coding.
180 worked examples guide students through the practical application of the theory.
- Type
- Chapter
- Information
- Channel CodesClassical and Modern, pp. 672 - 702Publisher: Cambridge University PressPrint publication year: 2024
References
Di, C., Proietti, D.. Teletar, I. E., Richardson, T. J., and Urbanke, R. L., “Finite length analysis of low-density parity-check codes on the binary erasure channels,” IEEE Transactions on Information Theory, vol. 48, no. 6, pp. 1576–1579, June 2002.Google Scholar
Orlitsky, A., Urbanke, R., Viswanathan, K., and Zhang, J., “Stopping sets and the girth of Tanner graphs,” Proceedings of the IEEE International Symposium on Information Theory, Lausanne, June 2002, p. 2.CrossRefGoogle Scholar
Luby, M. G., Mitzenmacker, M., Sokrollahi, M. A., and Spilman, D. A., “Efficient erasure correcting codes,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 569–584, February 2001.CrossRefGoogle Scholar
Orlitsky, A., Viswanathan, K., and Zhang, J., “Stopping sets distribution of LDPC code ensemble,” IEEE Transactions on Information Theory, vol. 51, no. 3, pp. 929–953, March 2005.CrossRefGoogle Scholar
Tian, T., Jones, C., Villasenor, J. D., and Wesel, R. D., “Construction of irregular LDPC code with low error floors,” Proceedings of the IEEE International Conference on Communications, Anchorage, AK, May 2003, pp. 3125–3129.CrossRefGoogle Scholar
Lan, L., Tai, Y. Y., Lin, S., Memari, B., and Honary, B., “New construction of quasi-cyclic LDPC codes based on special classes of BIBDs for the AWGN and binary erasure channels,” IEEE Transactions on Communications, vol. 56, no. 1, pp. 39–48, January 2008.Google Scholar
Lan, L., Zeng, L.-Q., Tai, Y. Y., Chen, L., Lin, S., and Abdel-Ghaffar, K., “Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: A finite field approach,” IEEE Transactions on Information Theory, vol. 53, no. 7, pp. 2429–2458, July 2007.CrossRefGoogle Scholar
Song, S., Lin, S., and Addel-Ghaffar, K., “Burst-correction decoding of cyclic LDPC codes,” Proceedings of the IEEE International Symposium on Information Theory, Seattle, WA, July 9–14, 2006, pp. 1718–1722.Google Scholar
Tai, Y. Y., Lan, L., Zeng, L.-Q., Lin, S., and Abdel-Ghaffar, K., “Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels,” IEEE Transactions on Communications, vol. 54, no. 10, pp. 1765–1774, October 2006.CrossRefGoogle Scholar
Ha, J. and McLaughlin, S. W., “Low-density parity-check codes over Gaussian channels with erasures,” IEEE Transactions on Information Theory, vol. 49, no. 7, pp. 1801–1809, July 2003.Google Scholar
Peng, F., Yang, M., and Ryan, W. E., “Design and analysis of eIRA codes on correlated fading channels,” Proceedings of the IEEE Global Telecommunications Conference, Dallas, TX, November–December 2004, pp. 503–508.Google Scholar
Yang, M. and Ryan, W. E., “Design of LDPC codes for two-state fading channel models,” Proceedings of the 5th International Symposium on Wireless Personal Multimedia Communications, Honolulu, HI, October 2002, pp. 503–508.Google Scholar
Yang, M. and Ryan, W. E., “Performance of efficiently encodable low-density parity-check codes in noise bursts on the EPR4 channel,” IEEE Transactions on Magnetics, vol. 40, no. 2, pp. 507–512, March 2004.CrossRefGoogle Scholar
Song, S., Lin, S., Abdel-Ghaffar, K., and Fong, W., “Erasure-burst and error-burst decoding of linear codes,” Proceedings of the IEEE Information Theory Workshop, Lake Tahoe, CA, September 2–6, 2007, pp. 132–137.Google Scholar
Burshtein, D. and Miller, B., “An efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel,” IEEE Transactions on Information Theory, vol. 50, no. 11, pp. 2837–2844, November 2004.CrossRefGoogle Scholar
Lin, S. and Costello, D. J., Jr., Error Control Coding: Fundamentals and Applications, Upper Saddle River, NJ, Prentice-Hall, 2004.Google Scholar
Oswald, P. and Shokrollahi, A., “Capacity-achieving sequences for erasure channels,” IEEE Transactions on Information Theory, vol. 48, no. 12, pp. 3017–3028, December 2002.CrossRefGoogle Scholar
Pfister, H. D., Sason, I., and Urbanke, R. L., “Capacity-approaching ensembles for the binary erasure channel with bounded complexity,” IEEE Transactions on Information Theory, vol. 51, no. 7, pp. 2352–2379, July 2005.CrossRefGoogle Scholar
Pishro-Nik, H. and Fekri, F., “On decoding of low-density parity-check codes over the binary erasure channel,” IEEE Transactions on Information Theory, vol. 50, vol 3, pp. 439–454, March 2004.CrossRefGoogle Scholar
Richardson, T. J. and Urbanke, R. L., Modern Coding Theory, Cambridge, Cambridge University Press, 2008.CrossRefGoogle Scholar
Rashidpour, M., Shokrollahi, A., and Jamali, S. H., “Optimal regular LDPC codes for the binary erasure channel,” IEEE Communications Letters, vol. 9, no. 6, pp. 546–548, June 2005.CrossRefGoogle Scholar
Saeedi, H. and Banihashimi, A. H., “Deterministic design of low-density parity-check codes for binary erasure channel,” Proceedings of IEEE Globecom, San Francisco, CA, November 2006, pp. 1566–1570.Google Scholar
Vellambi, B. N. and Fekri, F., “Results on the improved decoding algorithm for low-density parity-check codes over the binary erasure channels,” IEEE Transactions on Information Theory, vol. 53, no. 4, pp. 1510–1520, April 2007.CrossRefGoogle Scholar