Cyclic Redundancy Check

Prev: Gray Code

Next: Error-Correcting Codes

Sections

• 14-1 Introduction
• 14-2 Theory
• 14-3 Practice

Problems

1. Show that if a generator $G$ contains two or more terms, all single-bit errors are detected.

2. Referring to Figure 14-7, show how to code the main loop so that the message data is loaded one word at a time. For simplicity, assume the message is fullword aligned and an integral number of words in length, before the zero byte that marks the end of the message.