Let C be the binary linear code with parity check matrix /1 0 0 1 1 0 1) H = 0 1 0 0 1 1 1). (0 0 1 1 0 1 1) How many cosets does C have? Find the coset leaders by going through words of small weight and calculating their syndromes until you exhaust all possible syndromes. Decode received words (a) 1010101, (b) 1110001, (C) 0111111. Let C be the binary linear code with parity check matrix /1 0 0 1 1 0 1) H = 0 1 0 0 1 1 1). (0 0 1 1 0 1 1) How many cosets does C have? Find the coset leaders by going through words of small weight and calculating their syndromes until you exhaust all possible syndromes. Decode received words (a) 1010101, (b) 1110001, (C) 0111111