Western University

Faculty of Engineering
Department of Electrical and Computer Engineering

ECE 4433: Digital Communication Systems

EXERCISE-05
Try these problems (you need not submit solutions)
1. In a single parity check code, a single parity bit is appended to a block of k message bits (
m1 , m2 ,..., mk ). The single parity bit b1 is chosen so that the code word satisfies the even
parity rule:
m1 m2 mk b1 0
For k 3,4 , set up the 2 k possible code words in the code defined by this rule. In each
case determine the following: a) distance of the code; b) code rate; c) code redundancy;
and d) bandwidth expansion in percentage.
2. A code C consists of four code words given by:
C= {0000000000,0000011111,1111100000,1111111111}
Find the distance of the code and determine how many errors it can detect and how many
errors it can correct.
3. (a) Calculate the probabilities that a word has no errors, detected errors, and undetected
errors when a single parity check code with code word length of 4 is used. Assume that
transmission errors occur randomly and independently with probability of bit error equal
to 10 6 .
(b) Repeat (a) with code word length of 9 and probability of bit error equal to 10 3 .
4. Show that the final parity check in a horizontal and vertical parity check code, if taken as
the modulo 2 sum of all the data bits, is equal to the modulo 2 sum of the horizontal parity
checks and is also equal to the modulo 2 sum of the vertical parity checks.
5. Find an example of a pattern of six errors that cannot be detected by the use of horizontal
and vertical parity checks.
6. Consider the CRC-16 code described by the generator polynomial X 16 X 15 X 2 1 .
Using examples demonstrate the various error detection properties of the code.
7. Consider the (5, 1) repetition code. Evaluate the syndrome s for the following error
patterns:
a. All five possible single-error patterns;
b. All 10 possible double-error patterns.
8. Let g ( X ) X 4 X 2 X 1 and let m( X ) X 3 X 1 . Find the remainder when
X 4 m( X ) is divided by g ( X ) , using modulo 2 arithmetic.
9. Show that if g ( X ) contains the factor 1 X , then all error sequences with an odd number
of errors are detected.
10. Consider a (6, 2) code generated by the matrix:

1 1 1 0 1 0
1 0 1 1 0 1

a. Construct the code table for this code and determine the minimum distance between
the code words.
b. Prepare a suitable decoding table. This code can correct all single-error patterns,
seven double-error patterns, and two triple-error patterns.
11. A CRC is constructed to generate 4 check bits for an 11-bit message given by: 1 0 1 0 1 1
1 0 0 1 1. The generator polynomial is given by: X 4 X 3 1 . Compute the check bits.
12. Encode the message 101 using polynomial division and the generator
g( X ) 1 X X 2 X 4