Let C be a binary code with a check matrix:

(a) Prove that C is a [16,6,6]-code

(b) Draw the expander-graph for H and determine the largest possible expansion factor for = 1/4

(c) Decode (1,1,0,0,1,0,1,0,0,1,1,0,0,0,0,1)