DEATO, Margarita A55C

GEMATW Coding Theory

1. Let C={000000, 101110, 001010, 110111, 100100, 011001, 111101, 010011} be a binary code
of length 6.

(a) The minimum distance of C is the minimum number of differing bits, which is 2.
Therefore, d(C) = 2.

(b) A binary code can detect up to d-1 errors, where d is the minimum distance of the code.
In this case, d(C) = 2, so C can detect up to 1 error.

(c) A binary code can correct up to (d-1)/2 errors, where d is the minimum distance of the
code. In this case, d(C) = 2, so (d-1)/2 = 1/2. Since 1/2 is not a whole number, C cannot
correct any errors.

2. The notation (n, M, d) is used to represent a code with code length n, a total of M codewords,
and minimum distance d. One of the major goals of coding theory is to develop codes that strike
a balance between having a small n (for fast transmission of messages), a large M (to enable
transmission of a wide variety of messages), and a large d (to detect many errors). Describe
each of the following using the (n, M, d) notation:

(a) Given C1 = {0000, 1100, 0011, 1111}. Then C1 is a (4, 4, 2) binary code.

n=4
M = 4 codewords.
d is the minimum distance in C = 2
The minimum distance of C1 is the minimum number of differing bits, which is 2. Therefore, C1
= (4, 4, 2).

(b) Given C2 = {00000, 01101, 10110, 11011}. Then C2 is a (5, 4, 3)-code.

n=5
M=4
d is the minimum distance in C = 3
The minimum distance of C2 is the minimum number of differing bits, which is 3. Therefore, C2
= (5, 4, 3).