Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-6bf8c574d5-j5c6p Total loading time: 0 Render date: 2025-03-11T17:41:39.343Z Has data issue: false hasContentIssue false

13 - LDPC Codes Based on Combinatorial Designs, Graphs, and Superposition

Published online by Cambridge University Press:  06 March 2025

William E. Ryan ,
Shu Lin  and
Stephen G. Wilson
William E. Ryan
Affiliation:
Zeta Associates
Shu Lin
Affiliation:
University of California, Davis
Stephen G. Wilson
Affiliation:
University of Virginia
Get access

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 Codes
Classical and Modern
 , pp. 625 - 671
Publisher: Cambridge University Press
Print publication year: 2024

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bose, R. C., “On the construction of balanced incomplete block designs,” Annals of Eugenics, vol. 9, pp. 353–399, 1939.CrossRefGoogle Scholar
Blake, I. F. and Mullin, R. C., The Mathematical Theory of Coding, New York, Academic Press, 1975.Google Scholar
Carmichael, R. D., Introduction to Theory of Groups of Finite Orders, Boston, MA, Gin & Co., 1937.Google Scholar
Colbourn, C. J. and Dintz, J. H. (eds.), The Handbook of Combinatorial Designs, Boca Raton, FL, CRC Press, 1996.Google Scholar
Finney, D. J., An Introduction to the Theory of Experimental Design, Chicago, IL, University of Chicago Press, 1960.Google Scholar
Hall, M., Jr., Combinatorial Theory, 2nd ed., New York, Wiley, 1986.Google Scholar
Mann, H. B., Analysis and Design of Experiments, New York, Dover Publications, 1949.Google Scholar
Ryser, H. J., Combinatorial Mathematics, New York, Wiley, 1963.CrossRefGoogle Scholar
Ammar, B., Honary, B., Kou, Y., Xu, J., and Lin, S., “Construction of low density parity-check codes based on balanced incomplete designs,” IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1257–1268, June 2004.Google Scholar
Johnson, S. and Weller, S. R., “Regular low-density parity-check codes form combinatorial designs,” Proceedings of the 2001 IEEE Information Theory Workshop, Cairns, Australia, September 2001, pp. 90–92.CrossRefGoogle Scholar
Lan, L., Tai, Y. Y., Lin, S., Memari, B., and Honary, B., “New constructions 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.CrossRefGoogle Scholar
Vasic, B. and Milenkovic, O., “Combinatorial construction of low density parity-check codes for iterative decoding,” IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1156–1176, June 2004.CrossRefGoogle Scholar
Hu, X.-Y., Eleftheriou, E., and Arnold, D. M., “Regular and irregular progressive edge-growth Tanner graphs,” IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 386–398, January 2005.CrossRefGoogle Scholar
Lan, L., Tai, Y. Y., Chen, L., Lin, S., and Abdel-Ghaffar, K., “A trellis-based method for removal of cycles from bipartite graphs and construction of low density parity check codes,” IEEE Communications Letters, vol. 8, no. 7, pp. 443–445, July 2004.Google Scholar
Xiao, H. and Banihashemi, A. H., “Improved progressive-edge-growth (PEG) construction of irregular LDPC codes,” IEEE Communications Letters, vol. 8, no. 12, pp. 715–717, December 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
Tian, T., Jones, C., Villasenor, J. D., and Wesel, R. D., “Construction of irregular LDPC codes with low error floors,” Proceedings of the IEEE International Conference on Communications, vol. 5, Anchorage, AK, May 2003, pp. 3125–3129.CrossRefGoogle Scholar
Tian, T., Jones, C., Villasenor, J. D., and Wesel, R. D., “Selective avoidance of cycles in irregular LDPC code construction,” IEEE Transactions on Communications, vol. 52, no. 8, pp. 1242–1247, August 2004.Google Scholar
Xu, J. and Lin, S., “A combinatoric superposition method for constructing low-density parity-check codes,” Proceedings of the International Symposium on Information Theory, vol. 30, Yokohama, June–July 2003.Google Scholar
Xu, J., Chen, L., Zeng, L.-Q., Lan, L., and Lin, S., “Construction of low-density parity-check codes by superposition,” IEEE Transactions on Communications, vol. 53, no. 2, pp. 243–251, February 2005.CrossRefGoogle Scholar
Deo, N., Graph Theory and Applications to Engineering and Computer Engineering, Englewood Cliffs, NJ, Prentice-Hall, 1974.Google Scholar
West, D. B., Introduction to Graph Theory, 2nd ed., Upper Saddle River, NJ, Prentice-Hall, 2001.Google Scholar
Li, J., Lin, S., Abdel-Ghaffar, K., Ryan, W., and Costello, D. J., LDPC Code Design, Constructions and Unifications, Cambridge, Cambridge University Press, 2017.Google Scholar
Nasseri, M., Xiao, X., Vasic, B., and Lin, S., “Globally coupled finite-geometry and finite-field LDPC coding schemes.” IEEE Transactions on Vehicular Technology, vol. 70, no. 9, September 2021, pp. 9207–9216.Google Scholar
Diao, Q., Tai, Y. Y., Lin, S., and Abdel-Ghaffar, K., “LDPC codes on partial geometries: Construction, trapping sets structure, and puncturing,” IEEE Transactions on Information Theory, vol. 59, no. 12, pp. 7898–7914, September 2013.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×