Is the standard binary representation for positive integers (e.g. cb(5) = 101) a uniquely decodeable code?
Design a binary code for the positive integers, i.e., a mapping from n ∈ {1, 2, 3, . . .} to c(n) ∈ {0, 1} +, that is uniquely decodeable. Try to P design codes that are prefix codes and that satisfy the Kraft equality
