Skip to main content Accessibility help
Internet Explorer 11 is being discontinued by Microsoft in August 2021. If you have difficulties viewing the site on Internet Explorer 11 we recommend using a different browser such as Microsoft Edge, Google Chrome, Apple Safari or Mozilla Firefox.

Chapter 8: Error Correcting Codes

Chapter 8: Error Correcting Codes

pp. 125-140

Authors

, Arizona State University
Resources available Unlock the full potential of this textbook with additional resources. There are Instructor restricted resources available for this textbook. Explore resources
  • Add bookmark
  • Cite
  • Share

Summary

In this chapter, we discuss error correcting codes. We review the idea of hard versus soft decisions as types of symbol estimates that we provide to the decoder. We introduce the concepts of parity bits – which provide redundancy – and coding rate. We develop a simple, if flawed, toy systematic linear block code and use this code to demonstrate the concepts of generator matrix, hamming distance, and parity check matrix. By using the parity check matrix, we construct the syndrome and use this vector to perform error correction. To provide a set of viable systematic linear block codes, we introduce Hamming codes. We also introduce convolutional codes and relate the mathematical and shift-register block diagram forms. To enable decoding, we discuss the trellis diagram and use this diagram to motivate Viterbi decoding.

About the book

Access options

Review the options below to login to check your access.

Purchase options

eTextbook
US$100.00
Hardback
US$100.00

Have an access code?

To redeem an access code, please log in with your personal login.

If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.

Also available to purchase from these educational ebook suppliers