Let C be a code of the family Ham (3,2), and D = C * C. (a)

Question:

Let C be a code of the family Ham (3,2), and D = C * C.

(a) Find the dimension and minimum distance of D.

(b) Is D a perfect code?

(c) Give two reasons why, whichever Slepian array is chosen for D, not all words of weight 2 can be coset leaders.

(d) Find a parity check matrix for D, and hence find two error patterns each of weight 2, only one of which can be correctly decoded.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: