MH 8300 Tutorial Activity 1

Principles of Error Correction

Set A
Question 1. Let the code C1 = {00000, 11011, 11100, 00111}.
Sender sends the codeword 11011 across a channel and the receiver received 11001. The receiver decodes
11001 using Minimum Distance Decoding to obtain the word 11011.
(a) How many errors have occurred?
(b) What is the distance between the sent and received word?

1
1

(c) The communication model is shown below. Fill in the blanks.

Figure 1: Communication Model

(d) Find the ball with radius r = 1 for each of the codewords in C1 .
S1 (00000) =

{00000, 00001, 00010, 00100, 01000, 10000}

S1 (11011) =

{11011, 11010, 11001, 11111, 10011, 01011}

S1 (11100) =

{11100, 11101, 11110, 11000, 10100, 01100}

S1 (00111) =

{00111, 00110, 00101, 00011, 01111, 10111}

(e) Do any of the balls S1 (00000), S1 (11011), S1 (11100), S1 (00111) intersect? If yes, produce two balls
that intersect. No.
(f) If r = 2, will the balls intersect? If yes, produce two balls that intersect. If not, explain why.
Any 2 balls from S2 (00000), S2 (11011), S2 (11100), S2 (00111) will intersect e.g.
S2 (11011) = {11011, 11010, 11001, 11111, 10011, 01011, 11000, 11110, 10010, 01010,
11101, 10001, 01001, 10111, 01111, 00011}
S2 (11100) = {11100, 11101, 11110, 11000, 10100, 01100, 11111, 11001, 10101, 01101,
11010, 10110, 01110, 10000, 01000, 00100}
(g) Using Qn 1(f), provide a pair of sent codeword and received word such that the Minimum Distance
Decoding produces a codeword different from the sent codeword. Fill up the boxes with your
answers.
Multiple answers where received word is at least distance 2 from the sent codeword are
possible. One example given,

Question 2. Let the code C2 = {000000, 001101, 010011, 011110, 100110, 101011, 110101, 111000}.
3

(a) What is the minimum distance of C2 ?

(b) How many errors can the code C2 detect?

(c) How many errors can the code C2 correct?

(d) Given that y = 100101 is received, perform Minimum Distance Decoding to decode the sent codeword.

Decoded codeword :

dH (x, y)

000000

100101

001101

100101

010011

100101

011110

100101

100110

100101

101011

100101

110101

100101

111000

100101

110101

Question 3. Can a code of length 5, distance 3 with 6 codewords exist? If yes, find this code. If not,
explain why.
By the Sphere-packing upper bound, the size of a code of length 5 and distance 3 is at most
2n
V (5,1)

32
6

= 5 13 which is lesser than 6. Hence, such a code does not exist.

MH 8300 Tutorial Activity 1

Principles of Error Correction
Set B
Question 1. Let the code C1 = {10001, 01010, 01101, 10110}.
Sender sends the codeword 01010 across a channel and the receiver received 01000. The receiver decodes
01000 using Minimum Distance Decoding to obtain the word 01010.
(a) How many errors have occurred?
(b) What is the distance between the sent and received word?

1
1

(c) The communication model is shown below. Fill in the blanks.

Figure 1: Communication Model

(d) Find the ball with radius r = 1 for each of the codewords in C1 .
S1 (10001) =

{10001, 10000, 10011, 10101, 11001, 00001}

S1 (01010) =

{01010, 01011, 01000, 01110, 00010, 11010}

S1 (01101) =

{01101, 01100, 01111, 01001, 00101, 11101}

S1 (10110) =

{10110, 10111, 10100, 10010, 11110, 00110}

(e) Do any of the balls S1 (10001), S1 (01010), S1 (01101), S1 (10110) intersect? If yes, produce two balls
that intersect. No.
(f) If r = 2, will the balls intersect? If yes, produce two balls that intersect. If not, explain why.
Any 2 balls from S2 (10001), S2 (01010), S2 (01101), S2 (10110) will intersect e.g.
S2 (01010) = {01010, 01011, 01000, 01110, 00010, 11010, 01001, 01111, 00011, 11011,
01100, 00000, 11000, 00110, 11110, 10010}
S2 (01101) = {01101, 01100, 01111, 01001, 00101, 11101, 01110, 01000, 00100, 11100,
01011, 00111, 11111, 00001, 11001, 10101}
(g) Using Qn 1(f), provide a pair of sent codeword and received word such that the Minimum Distance
Decoding produces a codeword different from the sent codeword. Fill up the boxes with your
answers.
Multiple answers where received word is at least distance 2 from the sent codeword are
possible. One example given,

Question 2. Let the code C2 = {000000, 101001, 011010, 110011, 110100, 011101, 101110, 000111}.
3

(a) What is the minimum distance of C2 ?

(b) How many errors can the code C2 detect?

(c) How many errors can the code C2 correct?

(d) Given that y = 101100 is received, perform Minimum Distance Decoding to decode the sent codeword.

Decoded codeword :

dH (x, y)

000000

101100

101001

101100

011010

101100

110011

101100

110100

101100

011101

101100

101110

101100

000111

101100

101110

Question 3. Can a code of length 5, distance 3 with 6 codewords exist? If yes, find this code. If not,
explain why.
By the Sphere-packing upper bound, the size of a code of length 5 and distance 3 is at most
2n
V (5,1)

32
6

= 5 13 which is lesser than 6. Hence, such a code does not exist.

MH 8300 Tutorial Activity 1

Principles of Error Correction
Set C
Question 1. Let the code C1 = {01110, 10101, 10010, 01001}.
Sender sends the codeword 10101 across a channel and the receiver received 10111. The receiver decodes
10111 using Minimum Distance Decoding to obtain the word 10101.
(a) How many errors have occurred?
(b) What is the distance between the sent and received word?

1
1

(c) The communication model is shown below. Fill in the blanks.

Figure 1: Communication Model

(d) Find the ball with radius r = 1 for each of the codewords in C1 .
S1 (01110) =

{01110, 01111, 01100, 01010, 00110, 11110}

S1 (10101) =

{10101, 10100, 10111, 10001, 11101, 00101}

S1 (10010) =

{10010, 10011, 10000, 10110, 11010, 00010}

S1 (01001) =

{01001, 01000, 01011, 01101, 00001, 11001}

(e) Do any of the balls S1 (01110), S1 (10101), S1 (10010), S1 (01001) intersect? If yes, produce two balls
that intersect. No.
(f) If r = 2, will the balls intersect? If yes, produce two balls that intersect. If not, explain why.
Any 2 balls from S2 (01110), S2 (10101), S2 (10010), S2 (01001) will intersect e.g.
S2 (10101) = {10101, 10100, 10111, 10001, 11101, 00101, 10110, 10000, 11100, 00100,
10011, 11111, 00111, 11001, 00001, 01101}
S2 (10010) = {10010, 10011, 10000, 10110, 11010, 00010, 10001, 10111, 11011, 00011,
10100, 11000, 00000, 11110, 00110, 01010}
(g) Using Qn 1(f), provide a pair of sent codeword and received word such that the Minimum Distance
Decoding produces a codeword different from the sent codeword. Fill up the boxes with your
answers.
Multiple answers where received word is at least distance 2 from the sent codeword are
possible. One example given,

Question 2. Let the code C2 = {000000, 110100, 001101, 111001, 011010, 101110, 010111, 100011}.
3

(a) What is the minimum distance of C2 ?

(b) How many errors can the code C2 detect?

(c) How many errors can the code C2 correct?

(d) Given that y = 010110 is received, perform Minimum Distance Decoding to decode the sent codeword.

Decoded codeword :

dH (x, y)

000000

010110

110100

010110

001101

010110

111001

010110

011010

010110

101110

010110

010111

010110

100011

010110

010111

Question 3. Can a code of length 5, distance 3 with 6 codewords exist? If yes, find this code. If not,
explain why.
By the Sphere-packing upper bound, the size of a code of length 5 and distance 3 is at most
2n
V (5,1)

32
6

= 5 13 which is lesser than 6. Hence, such a code does not exist.