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-mcfzb Total loading time: 0 Render date: 2025-03-11T17:19:15.191Z Has data issue: false hasContentIssue false

1 - Coding and Capacity

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. 1 - 28
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

Shannon, C., “A mathematical theory of communication,” Bell System Technical Journal, pp. 379–423 (Part I), pp. 623–656 (Part II), July 1948.CrossRefGoogle Scholar
Hamming, R., “Error detecting and correcting codes,” Bell System Technical Journal, pp. 147–160, April 1950.CrossRefGoogle Scholar
Cover, T. and Thomas, J., Elements of Information Theory, 2nd ed., New York, Wiley, 2006.Google Scholar
Gallager, R., Information Theory and Reliable Communication, New York, Wiley, 1968.Google Scholar
McEliece, R., The Theory of Information and Coding: Student Edition, Cambridge, Cambridge University Press, 2004.CrossRefGoogle Scholar
Blahut, R., Principles and Practice of Information Theory, Reading, MA, Addison-Wesley, 1987.Google Scholar
Viterbi, A. and Omura, J., Principles of Digital Communication and Coding, New York, McGraw-Hill, 1979.Google Scholar
Proakis, J., Digital Communications, 4th ed., New York, McGraw-Hill, 2000.Google Scholar
Wilson, S., Digital Modulation and Coding, Englewood Cliffs, NJ, Prentice-Hall, 1996.Google Scholar
Golomb, S., “The limiting behavior of the Z-channel,” IEEE Transactions on Information Theory, vol. 26, no. 5, p. 372, May 1980.CrossRefGoogle Scholar
McEliece, R. J., “Are turbo-like codes effective on non-standard channels?,” IEEE Transactions onInformation Theory Society Newsletter, vol. 51, no. 4, pp. 1–8, December 2001.Google Scholar
Shannon, C. E., “Probability of error for optimal codes in a Gaussian channel,” Bell System Technical Journal, vol. 38, pp. 611–656, 1959.CrossRefGoogle Scholar
Valembois, A. and Fossorier, M. P. C., “Sphere-packing bounds revisited for moderate block lengths,” IEEE Transactions on Information Theory, vol. 50, pp. 2998–3014, 2004.CrossRefGoogle Scholar
Wiechman, G. and Sason, I., “An improved sphere-packing bound for finite-length codes on symmetric memoryless channels,” IEEE Transactions on Information Theory, vol. 54, no. 5, pp. 1962–1990, May 2008.CrossRefGoogle Scholar
Shannon, C. E., Gallager, R., and Berlekamp, E., “Lower bounds to error probability for decoding on discrete memoryless channels, Part I,” Information and Control, vol. 10, pp. 65–103, 1967.CrossRefGoogle Scholar
Polayanskiy, Y., Poor, H. V., and Verdu, S., “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 56, pp. 2307–2593, 2010.CrossRefGoogle Scholar
Neyman, J. and Pearson, E. S., “Sufficient statistics and uniformly most powerful tests of statistical hypotheses,” in Joint Statistical Papers, Berkeley, CA, University of California Press, 1967, pp. 240–264.CrossRefGoogle Scholar
Vazquez-Vilar, G., “Error probability bounds for Gaussian channels under maximal and average power constraints,” IEEE Transactions on Information Theory, vol. 67, pp. 3965–3985, 2021.CrossRefGoogle Scholar
Erseghe, T., “Coding in the finite-blocklength regime: Bounds based on Laplace integrals and their asymptotic approximations,” arXiv:1511.04629, 2015.Google Scholar
Durisi, G., https://github.com/gdurisi/fbl-notes.Google Scholar
Coskun, M. C., Durisi, G., Jerkovits, T., Liva, G., Ryan, W., Stein, B., Steiner, F., “Efficient error-correcting codes in the short blocklength regime,” Physical Communications, vol. 34, pp. 66–79, 2019.Google Scholar
Yang, H., Lang, E., Pan, M., and Wesel, R. D., “CRC-aided list decoding of convolutional codes in the short blocklength regime,” IEEE Transactions on Information Theory, vol. 68, pp. 3744–3766, 2022.CrossRefGoogle 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
×