🃏

052823 [H]
Created @May 28, 2023 1:50 PM

Text

Tags

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

(a) What is the minimum distance of C? (3 points)

Hamming distance (000000, 101110) = 4 Hamming distance (001010, 100100) = 4

Hamming distance (000000, 001010) = 2 Hamming distance (001010, 011001) = 3

Hamming distance (000000, 110111) = 5 Hamming distance (001010, 111101) = 5

Hamming distance (000000, 100100)= 2 Hamming distance (001010, 010011) = 3

Hamming distance (000000, 011001) = 3 Hamming distance (110111, 100100) = 3

Hamming distance (000000, 111101) = 5 Hamming distance (110111, 011001) = 4

Hamming distance (000000, 010011) = 3 Hamming distance (110111, 111101) = 2

Hamming distance (101110, 001010) = 2 Hamming distance (110111, 010011) = 2

Hamming distance (101110, 110111) = 3 Hamming distance (100100, 011001) = 5

Hamming distance (101110, 100100) = 2 Hamming distance (100100, 111101) = 3

Hamming distance (101110, 011001) = 5 Hamming distance (100100, 010011) = 5

Hamming distance (101110, 111101) = 3 Hamming distance (011001, 111101) = 2

Hamming distance (101110, 010011) = 5 Hamming distance (011001, 010011) = 2

Hamming distance (001010, 110111) = 5 Hamming distance (111101, 010011) = 4

Minimum distance is 2

(b) How many errors will C detect? (2 points)

Let C be a code with minimum Hamming distance 2e+1

2e + 1 = 2
2e = 2 - 1
2e = 1

The code can detect up to 1 error

(c) How many errors will C correct? (1 points)

Let C be a code with minimum Hamming distance 2e+1

2e + 1 = 2
2e = 2 - 1
2e = 1
e = 0.5

The code cannot correct any error as 0.5 will be rounded down to 0

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

052823 [H] 1
 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) C1={0000, 1100, 0011, 1111} (2 points)

Code length = 4
Codewords = 4

Minimum distance = 2

n=4
M=4
d=2

(b) C2={00000, 01101, 10110, 11011} (2 points)

Code length = 5

Codewords = 4

Minimum distance = 3

n=5
M=4
d=3

052823 [H] 2