Consider a binary (N, K) code B with parity-check matrix H and minimum distance d. Assume that some of its code words have odd weight. Form a code Bb by concatenating a 0 at the end of every codeword...

Consider a binary (N, K) code B with parity-check matrix H and minimum distance d. Assume that some of its code words have odd weight. Form a code Bb by concatenating a 0 at the end of every codeword of even weight and a 1 at the end of every codeword of odd weight. This technique is called extending a code.

a) Determine dmin for Bb.

b) Give a parity-check matrix for the extended code Bb.