Using Theorem 1.10 to verify that the following codes are uniquely decodable: (1) C = {0, 10, 1100, 1101, 1110, 1111}. (2) C = {0, 01, 011, 0111, 01111, 11111}. For the code in part (2), how should the receiver react on receiving a sequence starting 011111 1 ?

Theorem 1.10

A code C is uniquely decodable if and only if the sets C and Coo are disjoint.

Using Theorem 1.10 to verify that the following codes are uniquely de- codable: (1) C [0, 10, 1100, 1101, 1110, 1111) (2) C-(0,01, 011,0 For the code in part (2), how should the receiver react on receiving a sequence starting Using Theorem 1.10 to verify that the following codes are uniquely de- codable: (1) C [0, 10, 1100, 1101, 1110, 1111) (2) C-(0,01, 011,0 For the code in part (2), how should the receiver react on receiving a sequence starting