Do not just provide an answer, always explain it. Problem 1 Consider a parity-check code defined by its parity-check matrix H given below 1 1 0 1 1 00 0 It is used for transmission over a BSC with crossover probability p. Codeword mitted and we denote the sequence at the output of the channel by y is trans- Questions (7 points total): 1. Compute minimum distance of the code, its length and dimension (1p) 2. Perfor inimu distance decoding for a sequence y01010101 (2p) 3. Derive union bound on the maximum likelihood decoding in terms of p (4p) Do not just provide an answer, always explain it. Problem 1 Consider a parity-check code defined by its parity-check matrix H given below 1 1 0 1 1 00 0 It is used for transmission over a BSC with crossover probability p. Codeword mitted and we denote the sequence at the output of the channel by y is trans- Questions (7 points total): 1. Compute minimum distance of the code, its length and dimension (1p) 2. Perfor inimu distance decoding for a sequence y01010101 (2p) 3. Derive union bound on the maximum likelihood decoding in terms of p (4p)