Question: Let C be the binary code {(0,0, 1), (1, 1, 1), (1, 0, 0), (0, 1,0)}. a.) Show that C is not linear. b.)

Let C be the binary code {(0,0, 1), (1, 1, 1), (1, 0, 0), (0, 1,0)}. a.) Show that C is not linear. b.) What is the minimum distance of C? (Hint: since C is not minimum weight among the codewords.) c.) Show that C satisfies the Singleton bound with equality.
Step by Step Solution
3.37 Rating (150 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
