Checksum code Chapter 15 Consider a block of five 4-bit words: (1101, 0011, 1110, 0110, 0101).

We first calculate the sum without the remainder of all these words. The resulting 4-bit word W6 is then complemented to ' 2', that is to say we make the following arithmetic operation: r = 24 - W6. This word constitutes the redundant word which is added to the others data words. This code is called Checksum code.

1. Code this block with the help of Checksum code.

2. Show that if no error is present, the 'sum without the remainder' of the 6 preceding words must be equal to '0' .

3. What errors do we detect?

4. What errors are not detectable?