Berger code 425 1. Draw the codeword table of aBerger code with m = 4. 1s this code optimal?

2. Show that this code allows the detection of every unidirectional error. We will analyze this error detection capability with an error that increases the number of '0' bits, first of all on X, then on R, then on the 2 parts. Then, we will reason with an error that reduces the number of '0' .

3. Consider a code derived from aBerger code that requires the calculation of the number of '1' bits in X in order to formulate the redundant part R.

This code strongly looks like the Berger code. Show that this code does not allow, however, the detection ofunidirectional errors.